Layers and matroids for the traveling salesman’s paths

Gottschalk and Vygen proved that every solution of the subtour elimination linear program for traveling salesman paths is a convex combination of more and more restrictive “generalized Gao-trees”. We give a short proof of this fact, as a layered convex combination of bases of a sequence of increasin...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operations research letters Ročník 46; číslo 1; s. 60 - 63
Hlavní autoři: Schalekamp, Frans, Sebő, András, Traub, Vera, van Zuylen, Anke
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.01.2018
Elsevier
Témata:
Approximation algorithm
Christofides’ heuristic
Combinatorics
Computer Science
Discrete Mathematics
Mathematics
Matroid partition
Path traveling salesman problem (TSP)
Polyhedra
Spanning tree
Christofides’ heuristic
Polyhedra
Matroid partition
Approximation algorithm
Path traveling salesman problem (TSP)
Spanning tree
ISSN:0167-6377, 1872-7468
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Gottschalk and Vygen proved that every solution of the subtour elimination linear program for traveling salesman paths is a convex combination of more and more restrictive “generalized Gao-trees”. We give a short proof of this fact, as a layered convex combination of bases of a sequence of increasingly restrictive matroids. A strongly polynomial, combinatorial algorithm follows for finding this convex combination, which is a new tool offering polyhedral insight, already instrumental in recent results for the s−t path TSP.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2017.11.002