A restricted Lagrangean approach to the traveling salesman problem
- 1 December 1981
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 21 (1), 19-46
- https://doi.org/10.1007/bf01584228
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Combinatorial Optimization: What is the State of the ArtMathematics of Operations Research, 1980
- Cutting planes from conditional bounds: A new approach to set coveringPublished by Springer Nature ,1980
- Travelling Salesman and Assignment Problems: A SurveyAnnals of Discrete Mathematics, 1979
- Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problemMathematical Programming, 1974
- Technical Note—Bounds for the Travelling-Salesman ProblemOperations Research, 1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Pathology of Traveling-Salesman Subtour-Elimination AlgorithmsOperations Research, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- The Shortest Hamiltonian Chain of a GraphSIAM Journal on Applied Mathematics, 1970
- The Traveling Salesman Problem: A SurveyOperations Research, 1968