Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem
From MaRDI portal
Publication:1824571
DOI10.1016/0305-0548(90)90034-5zbMath0682.90091OpenAlexW2090944138MaRDI QIDQ1824571
Publication date: 1990
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(90)90034-5
Related Items
Cites Work
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- Nonoptimal Edges for the Symmetric Traveling Salesman Problem
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- On Some Generalizations of the Travelling-Salesman Problem
- Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
- Note—On the Use of Fictitious Bounds in Tree Search Algorithms
- The traveling salesman problem: A duality approach
- Branch-and-Bound Methods: A Survey
- The Traveling-Salesman Problem and Minimum Spanning Trees