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 1, Pages 27–40 (Mi da636)  
This article is cited in 1 scientific paper (total in 1 paper)

The complexity of optimal recombination for the traveling salesman problem

A. V. Eremeev

Omsk Branch of Sobolev Institute of Mathematics SB RAS, Omsk, Russia
Full-text PDF (405 kB) Citations (1)
References:
PDF
HTML
Abstract: The computational complexity of optimal recombination for the traveling salesman problem is considered in the symmetric and general cases. NP-hardness of these problems is proven and some approaches to their solution are indicated. Ill. 3, bibliogr. 15.
Keywords: traveling salesman problem, genetic algorithm, optimal recombination, computational complexity, problem transformation.
Received: 02.08.2010
Revised: 18.10.2010
Bibliographic databases:
Document Type: Article
UDC: 519.854
Language: Russian
Citation: A. V. Eremeev, “The complexity of optimal recombination for the traveling salesman problem”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 27–40
Citation in format AMSBIB
\Bibitem{Ere11}
\by A.~V.~Eremeev
\paper The complexity of optimal recombination for the traveling salesman problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2011
\vol 18
\issue 1
\pages 27--40
\mathnet{http://mi.mathnet.ru/da636}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2847827}
\zmath{https://zbmath.org/?q=an:1249.90220}
Linking options:
  • https://www.mathnet.ru/eng/da636
  • https://www.mathnet.ru/eng/da/v18/i1/p27
    • 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:370
    Full-text PDF :112
    References:50
    First page:11
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024