A complete description of the traveling salesman polytope on 8 nodes
From MaRDI portal
Publication:1186944
DOI10.1016/0167-6377(91)90067-YzbMath0744.90070OpenAlexW2073906627MaRDI QIDQ1186944
Thomas Christof, Gerhard Reinelt, Michael Jünger
Publication date: 28 June 1992
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(91)90067-y
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)
Related Items
A note on small linear-ordering polytopes, On the complexity of some basic problems in computational convexity. I. Containment problems, Complete linear descriptions of small asymmetric traveling salesman polytopes, On the graphical relaxation of the symmetric traveling salesman polytope, Coxeter‐associahedra, Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry, The inequicut cone, New facets of the STS polytope generated from known facets of the ATS polytope, DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES, New semidefinite programming relaxations for the linear ordering and the traveling salesman problem, The graphical relaxation: A new framework for the symmetric traveling salesman polytope, Hamiltonian path and symmetric travelling salesman polytopes, Combinatorial optimization and small polytopes, On the facial structure of symmetric and graphical traveling salesman polyhedra, Survey of facial results for the traveling salesman polytope
Cites Work
