On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem

DOI10.1016/S0167-6377(01)00088-8zbMath1018.90036WikidataQ127333179 ScholiaQ127333179MaRDI QIDQ5952070

No author found.

Publication date: 15 September 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

traveling salesman problemcompact descriptionsproblem formulationssubtour elimination polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope, On pedigree polytopes and Hamiltonian cycles, Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration, On Pedigree Polytopes and Hamiltonian Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• An analytical comparison of different formulations of the travelling salesman problem
• An alternate formulation of the symmetric traveling salesman problem and its properties
• Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
• Solution of a Large-Scale Traveling-Salesman Problem