Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Izv. Vyssh. Uchebn. Zaved. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2014, Number 1, Pages 41–54 (Mi ivm8861)  
This article is cited in 4 scientific papers (total in 4 papers)

Finding and analysis of estimation of the number of iterations in integer programming algorithms using the regular partitioning method

A. A. Kolokolovab, L. A. Zaozerskayaab

a Chair of Applied and Computational Mathematics, Omsk State University
b Discrete Optimization Laboratory, Omsk Branch of Sobolev Institute of Mathematics SB RAS, 13 Pevtsov str., Omsk, 644043 Russia
Full-text PDF (249 kB) Citations (4)
References:
PDF
HTML
Abstract: We review the results of studying integer linear programming algorithms which exploit properties of problem relaxation sets. The main attention is paid to the estimation of the number of iterations of these algorithms by means of the regular partitions method and other approaches. We present such estimates for some cutting plane, branch and bound (Land and Doig scheme), and $L$-class enumeration algorithms and consider questions of their stability. We establish the upper bounds for the average number of iterations of the mentioned algorithms as applied to the knapsack problem and the set packing one.
Keywords: discrete optimization, integer programming, regular partitions method, estimates of the number of iterations, cuts, $L$-class enumeration, branch and bound method, estimates on average, stability of algorithms.
Received: 22.08.2012
English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2014, Volume 58, Issue 1, Pages 35–46
DOI: https://doi.org/10.3103/S1066369X14010046
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
Citation: A. A. Kolokolov, L. A. Zaozerskaya, “Finding and analysis of estimation of the number of iterations in integer programming algorithms using the regular partitioning method”, Izv. Vyssh. Uchebn. Zaved. Mat., 2014, no. 1, 41–54; Russian Math. (Iz. VUZ), 58:1 (2014), 35–46
Citation in format AMSBIB
\Bibitem{KolZao14}
\by A.~A.~Kolokolov, L.~A.~Zaozerskaya
\paper Finding and analysis of estimation of the number of iterations in integer programming algorithms using the regular partitioning method
\jour Izv. Vyssh. Uchebn. Zaved. Mat.
\yr 2014
\issue 1
\pages 41--54
\mathnet{http://mi.mathnet.ru/ivm8861}
\transl
\jour Russian Math. (Iz. VUZ)
\yr 2014
\vol 58
\issue 1
\pages 35--46
\crossref{https://doi.org/10.3103/S1066369X14010046}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84892530380}
Linking options:
  • https://www.mathnet.ru/eng/ivm8861
  • https://www.mathnet.ru/eng/ivm/y2014/i1/p41
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Известия высших учебных заведений. Математика Russian Mathematics (Izvestiya VUZ. Matematika)
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025