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, 2008, Volume 48, Number 5, Pages 788–807 (Mi zvmmf137)  
This article is cited in 14 scientific papers (total in 14 papers)

Computational bounds for local search in combinatorial optimization

Yu. A. Kochetov

Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, pr. Akademika Koptyuga 4, Novosibirsk, 630090, Russia
Full-text PDF (3283 kB) Citations (14)
References:
PDF
HTML
Abstract: The results related to finding local optima in combinatorial optimization are overviewed. The class of polynomial-time local search problems (class PLS) is considered. By analogy with Cook's theorem, the existence of most complicated problems in this class is established. The number of steps in local descent algorithms is estimated in the worst and average cases. The local search determination of exact and approximate solutions with guaranteed error bounds is discussed.
Key words: local search, PLS-complete problems, metaheuristics, overview.
Received: 12.10.2007
English version:
Computational Mathematics and Mathematical Physics, 2008, Volume 48, Issue 5, Pages 747–763
DOI: https://doi.org/10.1134/S0965542508050059
Bibliographic databases:
Document Type: Article
UDC: 519.658
Language: Russian
Citation: Yu. A. Kochetov, “Computational bounds for local search in combinatorial optimization”, Zh. Vychisl. Mat. Mat. Fiz., 48:5 (2008), 788–807; Comput. Math. Math. Phys., 48:5 (2008), 747–763
Citation in format AMSBIB
\Bibitem{Koc08}
\by Yu.~A.~Kochetov
\paper Computational bounds for local search in combinatorial optimization
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2008
\vol 48
\issue 5
\pages 788--807
\mathnet{http://mi.mathnet.ru/zvmmf137}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2433640}
\zmath{https://zbmath.org/?q=an:1164.90388}
\transl
\jour Comput. Math. Math. Phys.
\yr 2008
\vol 48
\issue 5
\pages 747--763
\crossref{https://doi.org/10.1134/S0965542508050059}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000262334100005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-44149121444}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf137
  • https://www.mathnet.ru/eng/zvmmf/v48/i5/p788
    • This publication is cited in the following 14 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024