RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., Ser. 1, 1999, Volume 6, Number 4, Pages 104–120 (Mi da330)  

This article is cited in 3 scientific papers (total in 3 papers)

Maximization of a linear objective function by a greedy algorithm

V. V. Shenmaier

Novosibirsk State University

Full text: PDF file (1739 kB)

Bibliographic databases:
UDC: 519.176
Received: 01.04.1999

Citation: V. V. Shenmaier, “Maximization of a linear objective function by a greedy algorithm”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999), 104–120

Citation in format AMSBIB
\Bibitem{She99}
\by V.~V.~Shenmaier
\paper Maximization of a~linear objective function by a~greedy algorithm
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 1999
\vol 6
\issue 4
\pages 104--120
\mathnet{http://mi.mathnet.ru/da330}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1760732}
\zmath{https://zbmath.org/?q=an:1028.90030}


Linking options:
  • http://mi.mathnet.ru/eng/da330
  • http://mi.mathnet.ru/eng/da/v6/s1/i4/p104

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. N. I. Glebov, “Ob usloviyakh razreshimosti optimizatsionnykh zadach zhadnym algoritmom”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 9:2 (2002), 3–12  mathnet  mathscinet  zmath
    2. V. P. Ilyev, “Problems on independence systems solvable by the greedy algorithm”, Discrete Math. Appl., 19:5 (2009), 515–522  mathnet  crossref  crossref  mathscinet  elib
    3. V. M. Montlevich, A. N. Ismailova, “Empiricheskii analiz priblizhennykh algoritmov tselochislennogo programmirovaniya, osnovannykh na idee zhadnogo vybora”, Vestn. SamGU. Estestvennonauchn. ser., 2014, no. 3(114), 115–120  mathnet
  • ƒискретный анализ и исследование операций
    Number of views:
    This page:347
    Full text:118

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020