An alternate formulation of the symmetric traveling salesman problem and its properties
From MaRDI portal
DOI10.1016/S0166-218X(99)00154-7zbMATH Open0947.90097OpenAlexW2003186772MaRDI QIDQ1962065FDOQ1962065
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
Cites Work
- An analytical comparison of different formulations of the travelling salesman problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- A Dynamic Programming Approach to Sequencing Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- 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 Pedigree Polytopes and Hamiltonian Cycles
- On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
- Title not available (Why is that?)
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
- The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)
- On pedigree polytopes and Hamiltonian cycles
- Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration
Recommendations
- An analytical comparison of different formulations of the travelling salesman problem 👍 👎
- A New Formulation for the Travelling Salesman Problem 👍 👎
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem 👍 👎
- Symmetric travelling salesman problem. Some new algorithmic possibilities 👍 👎
- Small Travelling Salesman Polytopes 👍 👎
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)
