The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm
- 1 March 1986
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 13 (2-3) , 259-276
- https://doi.org/10.1016/0166-218x(86)90087-9
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The traveling salesman problem: A duality approachMathematical Programming, 1977
- Validation of subgradient optimizationMathematical Programming, 1974
- Transformation of Multisalesman Problem to the Standard Traveling Salesman ProblemJournal of the ACM, 1974
- Computational Experience with an M-Salesman Traveling Salesman AlgorithmManagement Science, 1973
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- Matroids and the greedy algorithmMathematical Programming, 1971
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Duality in Nonlinear Programming: A Simplified Applications-Oriented DevelopmentSIAM Review, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960