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, 2011, Volume 18, Issue 3, Pages 49–64 (Mi da653)  
This article is cited in 1 scientific paper (total in 1 paper)

Bounds on average number of iterations of the algorithms for solving some Boolean programming problems

L. A. Zaozerskaya, A. A. Kolokolov, N. G. Gofman

Omsk Department of S. L. Sobolev Institute of Mathematics, SB RAS, Omsk, Russia
Full-text PDF (290 kB) Citations (1)
References:
PDF
HTML
Abstract: The paper is devoted to the polynomial upper bounds on average number of iterations for some integer linear programming algorithms for solving the multidimensional knapsack problem and the set packing problem. These results were obtained using earlier suggested approach. Expansions of the known classes of problems with similar bounds are described. Tab. 2, bibliogr. 19.
Keywords: average number of iterations, knapsack problem, set packing problem, Gomory cut, branch and bound algorithm, $L$-class enumeration.
Received: 01.06.2010
Revised: 07.10.2010
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
Citation: L. A. Zaozerskaya, A. A. Kolokolov, N. G. Gofman, “Bounds on average number of iterations of the algorithms for solving some Boolean programming problems”, Diskretn. Anal. Issled. Oper., 18:3 (2011), 49–64
Citation in format AMSBIB
\Bibitem{ZaoKolGof11}
\by L.~A.~Zaozerskaya, A.~A.~Kolokolov, N.~G.~Gofman
\paper Bounds on average number of iterations of the algorithms for solving some Boolean programming problems
\jour Diskretn. Anal. Issled. Oper.
\yr 2011
\vol 18
\issue 3
\pages 49--64
\mathnet{http://mi.mathnet.ru/da653}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2883747}
\zmath{https://zbmath.org/?q=an:1249.90229}
Linking options:
  • https://www.mathnet.ru/eng/da653
  • https://www.mathnet.ru/eng/da/v18/i3/p49
    • 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:355
    Full-text PDF :173
    References:56
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024