New lower bounds for the Symmetric Travelling Salesman Problem
- 1 August 1989
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 45 (1) , 233-254
- https://doi.org/10.1007/bf01589105
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A branch and bound algorithm for the multiple depot vehicle scheduling problemNetworks, 1989
- An Additive Bounding Procedure for Combinatorial Optimization ProblemsOperations Research, 1989
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen ProblemsOperations Research, 1986
- A restricted Lagrangean approach to the traveling salesman problemMathematical Programming, 1981
- 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
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- A note on two problems in connexion with graphsNumerische Mathematik, 1959