An alternate formulation of the symmetric traveling salesman problem and its properties

DOI10.1016/S0166-218X(99)00154-7MaRDI QIDQ1962065zbMATHOpenAlexFDO

Authors Yanyan Li

Publication date 30 January 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00154-7

zbMATH Keywords

traveling salesman problemproblem formulationssubtour elimination polytope

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• A New Formulation for the Travelling Salesman Problem
• An analytical comparison of different formulations of the travelling salesman problem
• A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
• Small Travelling Salesman Polytopes
• Symmetric travelling salesman problem. Some new algorithmic possibilities

Cites work

• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• scientific article; zbMATH DE number 795217 (Why is no real title available?)
• A Dynamic Programming Approach to Sequencing Problems
• A classification of formulations for the (time-dependent) traveling salesman problem
• An analytical comparison of different formulations of the travelling salesman problem
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem

Cited in

(11)

• scientific article; zbMATH DE number 1342125 (Why is no real title available?)
• Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
• On Pedigree Polytopes and Hamiltonian Cycles
• The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)
• Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
• Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration
• A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths
• Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
• Tabu search performance on the symmetric travelling salesman problem
• On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem
• On pedigree polytopes and Hamiltonian cycles

This page was built for publication: An alternate formulation of the symmetric traveling salesman problem and its properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962065)