Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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


Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 1998, Volume 5, Issue 4, Pages 45–60 (Mi da371)  

This article is cited in 1 scientific paper (total in 1 paper)

An estimate for the accuracy of the greedy descent algorithm for the problem of minimizing a supermodular function

V. P. Il'ev

Omsk State University
Received: 11.02.1998
Bibliographic databases:
UDC: 519.8
Language: Russian
Citation: V. P. Il'ev, “An estimate for the accuracy of the greedy descent algorithm for the problem of minimizing a supermodular function”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:4 (1998), 45–60
Citation in format AMSBIB
\Bibitem{Ile98}
\by V.~P.~Il'ev
\paper An estimate for the accuracy of the greedy descent algorithm for the problem of minimizing a~supermodular function
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 1998
\vol 5
\issue 4
\pages 45--60
\mathnet{http://mi.mathnet.ru/da371}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1680299}
\zmath{https://zbmath.org/?q=an:0942.90034}
Linking options:
  • https://www.mathnet.ru/eng/da371
  • https://www.mathnet.ru/eng/da/v5/s1/i4/p45
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:342
    Full-text PDF :189
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024