Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zh. Vychisl. Mat. Mat. Fiz.:
Year:
Volume:
Issue:
Page:
Find




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

Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2010, Volume 50, Number 2, Pages 242–248 (Mi zvmmf4823)  
This article is cited in 6 scientific papers (total in 6 papers)

Estimates for the average number of iterations for some algorithms for solving the set packing problem

L. A. Zaozerskaya, A. A. Kolokolov

Omsk Division of the Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, ul. Pevtsova 13, Omsk, 644099 Russia
Full-text PDF (233 kB) Citations (6)
References:
PDF
HTML
Abstract: The set packing problem and the corresponding integer linear programming model are considered. Using the regular partitioning method and available estimates of the average number of feasible solutions of this problem, upper bounds on the average number of iterations for the first Gomory method, the branch-and-bound method (the Land and Doig scheme), and the $L$-class enumeration algorithm are obtained. The possibilities of using the proposed approach for other integer programs are discussed.
Key words: discrete optimization, integer programming, set packing problem ,Gomory cut, $L$-partitioning, enumeration of $L$-classes.
Received: 26.02.2009
Revised: 27.07.2009
English version:
Computational Mathematics and Mathematical Physics, 2010, Volume 50, Issue 2, Pages 231–237
DOI: https://doi.org/10.1134/S0965542510020041
Bibliographic databases:
Document Type: Article
UDC: 519.658
Language: Russian
Citation: L. A. Zaozerskaya, A. A. Kolokolov, “Estimates for the average number of iterations for some algorithms for solving the set packing problem”, Zh. Vychisl. Mat. Mat. Fiz., 50:2 (2010), 242–248; Comput. Math. Math. Phys., 50:2 (2010), 231–237
Citation in format AMSBIB
\Bibitem{ZaoKol10}
\by L.~A.~Zaozerskaya, A.~A.~Kolokolov
\paper Estimates for the average number of iterations for some algorithms for solving the set packing problem
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2010
\vol 50
\issue 2
\pages 242--248
\mathnet{http://mi.mathnet.ru/zvmmf4823}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2681149}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2010CMMPh..50..231Z}
\transl
\jour Comput. Math. Math. Phys.
\yr 2010
\vol 50
\issue 2
\pages 231--237
\crossref{https://doi.org/10.1134/S0965542510020041}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000277336800004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77950491249}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf4823
  • https://www.mathnet.ru/eng/zvmmf/v50/i2/p242
    • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
    Statistics & downloads:
    Abstract page:528
    Full-text PDF :191
    References:70
    First page:6
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024