Small Travelling Salesman Polytopes
From MaRDI portal
Publication:3978615
DOI10.1287/moor.16.2.259zbMath0743.90106OpenAlexW2067684024MaRDI QIDQ3978615
William H. Cunningham, Sylvia Boyd
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
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10)
Related Items
On the even permutation polytope, Complete linear descriptions of small asymmetric traveling salesman polytopes, On the graphical relaxation of the symmetric traveling salesman polytope, Separating clique tree and bipartition inequalities in polynomial time, Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time, The inequicut cone, Branch and cut methods for network optimization, Certification of an optimal TSP tour through 85,900 cities, Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem, 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 facial structure of symmetric and graphical traveling salesman polyhedra, The 2-edge-connected subgraph polyhedron, Survey of facial results for the traveling salesman polytope
