Small Travelling Salesman Polytopes
From MaRDI portal
Publication:3978615
DOI10.1287/moor.16.2.259zbMath0743.90106MaRDI QIDQ3978615
Sylvia Boyd, William H. Cunningham
Publication date: 25 June 1992
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.16.2.259
90C35: Programming involving graphs or networks
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
90C10: Integer programming
Related Items
Branch and cut methods for network optimization, The inequicut cone, On the graphical relaxation of the symmetric traveling salesman polytope, Survey of facial results for the traveling salesman polytope, The graphical relaxation: A new framework for the symmetric traveling salesman polytope, Hamiltonian path and symmetric travelling salesman polytopes, The general routing polyhedron: A unifying framework, Combinatorial optimization and small polytopes, On the even permutation polytope, Complete linear descriptions of small asymmetric traveling salesman polytopes, The 2-edge-connected subgraph polyhedron