Identification of non-optimal arcs for the travelling salesman problem
- 31 July 1982
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 1 (3) , 85-88
- https://doi.org/10.1016/0167-6377(82)90002-5
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxationEuropean Journal of Operational Research, 1982
- Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian CircuitOperations Research, 1980
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965