Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Worker Cross-Training in Paced Assembly Lines
Manufacturing & Service Operations Management
Minimizing Cycle Time in a Blocking Flowshop
Operations Research
Multiple Part-Type Production in Robotic Cells: Equivalence of Two Real-World Models
Manufacturing & Service Operations Management
An approximation algorithm for a bottleneck traveling salesman problem
Journal of Discrete Algorithms
An approximation algorithm for a bottleneck traveling salesman problem
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On Gilmore-Gomory's open question for the bottleneck TSP
Operations Research Letters
On Eulerian extensions and their application to no-wait flowshop scheduling
Journal of Scheduling
| Hi-index | 0.00 |
We reconsider the version of the traveling salesman problem (TSP) first studied in a well-known paper by Gilmore and Gomory (1964). In this, the distance between two cities A and B, is an integrable function of the x-coordinate of A and the y-coordinate of B. This problem finds important applications in machine scheduling, workforce planning, and combinatorial optimization. We solve this TSP variant by a {\mathcal O}(n log n) algorithm considerably simpler than previously known algorithms. The new algorithm demonstrates and exploits the structure of an optimal solution, and recreates it using minimal storage space without the use of edge interchanges.