Efficiently solvable special cases of bottleneck travelling salesman problems
- 1 June 1991
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 32 (1) , 61-76
- https://doi.org/10.1016/0166-218x(91)90024-q
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman ProblemsOperations Research, 1977
- A solvable case of the traveling salesman problemMathematical Programming, 1971
- Extreme Hamiltonian LinesAnnals of Mathematics, 1957