Special cases of the traveling salesman problem
From MaRDI portal
Publication:1316125
DOI10.1016/0096-3003(94)90103-1zbMath0789.90087OpenAlexW2027236728MaRDI QIDQ1316125
Publication date: 10 April 1994
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-3003(94)90103-1
Related Items
Adapting the traveling salesman problem to an adiabatic quantum computer ⋮ A new asymmetric pyramidally solvable class of the traveling salesman problem ⋮ Landscapes and their correlation functions ⋮ GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classes of matrices for the traveling salesman problem
- The traveling salesman problem. Approximate algorithms
- The traveling salesman problem. I: Theoretical issues
- The traveling salesman problem. II: Exact methods
- Recognition of Gilmore-Gomory traveling salesman problem
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
- Identification of non-optimal arcs for the traveling salesman problem
- Optimal arcs for the traveling salesman problem
- Testing the necklace condition for shortest tours and optimal factors in the plane
- On the symmetric traveling salesman problem
- Special cases of travelling salesman problems and heuristics
- A Dynamic Programming Approach to Sequencing Problems
- Nonoptimal Edges for the Symmetric Traveling Salesman Problem
- Universal conditions for algebraic travelling salesman problems to be efficiently solvable
- Efficient special case algorithms for the n-line planar traveling salesman problem
- The n-line traveling salesman problem
- Stability of the travelling salesman problem
- Travelling Salesman and Assignment Problems: A Survey
- Edgeconvex Circuits and the Traveling Salesman Problem
