A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation
- 1 January 1977
- book chapter
- Published by Elsevier
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Validation of subgradient optimizationMathematical Programming, 1974
- Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problemMathematical Programming, 1974
- The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution ProblemsTransportation Science, 1972
- 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
- Integer Programming by Implicit Enumeration and Balas’ MethodSIAM Review, 1967
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming ProblemOperations Research, 1965
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- A note on two problems in connexion with graphsNumerische Mathematik, 1959