A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- 31 January 1982
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 9 (1) , 83-89
- https://doi.org/10.1016/0377-2217(82)90015-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree RelaxationPublished by Elsevier ,1977
- Validation of subgradient optimizationMathematical Programming, 1974
- Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problemMathematical Programming, 1974
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- The Shortest Hamiltonian Chain of a GraphSIAM Journal on Applied Mathematics, 1970
- A Heuristic Approach to Solving Travelling Salesman ProblemsManagement Science, 1964
- A note on two problems in connexion with graphsNumerische Mathematik, 1959