Searching the k-change neighborhood for TSP is W[1]-hard
Year of publication: |
2008
|
---|---|
Authors: | Marx, Dániel |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 36.2008, 1, p. 31-36
|
Subject: | Rundreiseproblem | Travelling salesman problem | Operations Research | Operations research |
-
Logistische Routenplanung unter Zeitrestriktionen : eine Simulationsstudie
Grupp, Bernhard, (1987)
-
Algorithms for the universal and a priori TSP
Schalekamp, Frans, (2008)
-
Lexicographically minimizing axial motions for the Euclidean TSP
Sourd, Francis, (2010)
- More ...
-
Sovereign debt restructuring : the future case of Argentina
Marx, Dániel, (2005)
-
A short proof of the NP-completeness of minimum sum interval coloring
Marx, Dániel, (2005)
-
Searching the k-change neighborhood for TSP is W[1]-hard
Marx, Dániel, (2008)
- More ...