A note on exploiting the Hamiltonian cycle problem substructure of the Asymmetric Traveling Salesman Problem
Authors:
- 1 April 1991
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 10 (3) , 173-176
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A parallel shortest augmenting path algorithm for the assignment problemJournal of the ACM, 1991
- Exact Solution of Large Asymmetric Traveling Salesman ProblemsScience, 1991
- An algorithm for finding hamilton cycles in random directed graphsJournal of Algorithms, 1988
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954