An additive bounding procedure for the asymmetric travelling salesman problem
- 1 January 1992
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 53 (1-3) , 173-197
- https://doi.org/10.1007/bf01585701
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- New lower bounds for the Symmetric Travelling Salesman ProblemMathematical Programming, 1989
- A branch and bound algorithm for the multiple depot vehicle scheduling problemNetworks, 1989
- An Additive Bounding Procedure for Combinatorial Optimization ProblemsOperations Research, 1989
- Algorithms and codes for the assignment problemAnnals of Operations Research, 1988
- A restricted Lagrangean approach to the traveling salesman problemMathematical Programming, 1981
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman ProblemManagement Science, 1980
- The k best spanning arborescences of a networkNetworks, 1980
- A note on finding optimum branchingsNetworks, 1979
- Technical Note—Bounds for the Travelling-Salesman ProblemOperations Research, 1972
- Pathology of Traveling-Salesman Subtour-Elimination AlgorithmsOperations Research, 1971