A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
Sequencing of insertions in printed circuit board assembly
Operations Research
Discrete Applied Mathematics
A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
Information Processing Letters
A linear time algorithm for the bottleneck biconnected spanning subgraph problem
Information Processing Letters
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
Information Processing Letters
The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis
Journal of the ACM (JACM)
On the Maximum Scatter Traveling Salesperson Problem
SIAM Journal on Computing
An approximation algorithm for a bottleneck traveling salesman problem
Journal of Discrete Algorithms
Guaranteed performance heuristics for the bottleneck travelling salesman problem
Operations Research Letters
On Gilmore-Gomory's open question for the bottleneck TSP
Operations Research Letters
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis
Computers and Operations Research
| Hi-index | 0.00 |
In this paper we develop efficient heuristic algorithms to solve the bottleneck traveling salesman problem (BTSP). Results of extensive computational experiments are reported. Our heuristics produced optimal solutions for all the test problems considered from TSPLIB, JM-instances, National TSP instances, and VLSI TSP instances in very reasonable running time. We also conducted experiments with specially constructed `hard' instances of the BTSP that produced optimal solutions for all but seven problems. Some fast construction heuristics are also discussed. Our algorithms could easily be modified to solve related problems such as the maximum scatter TSP and testing hamiltonicity of a graph.