The Bottleneck Traveling Salesman Problem

DOI10.1145/322077.322086zbMath0378.90095OpenAlexW2060827745WikidataQ56019909 ScholiaQ56019909MaRDI QIDQ4159199

K. C. Gilbert, Robert Garfinkel

Publication date: 1978

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322077.322086

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items

A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem ⋮ A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph ⋮ Neural methods for the traveling salesman problem: Insights from operations research ⋮ The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ A fast algorithm for a class of bottleneck problems ⋮ Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations ⋮ Experimental analysis of heuristics for the bottleneck traveling salesman problem ⋮ Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs ⋮ Traveling salesman problem under categorization ⋮ The Guilty net for the traveling salesman problem ⋮ An efficient heuristic algorithm for the bottleneck traveling salesman problem ⋮ The traveling salesman problem: new polynomial approximation algorithms and domination analysis ⋮ An approach for solving a class of transportation scheduling problems ⋮ Guaranteed performance heuristics for the bottleneck traveling salesman problem ⋮ A linear time algorithm for the bottleneck biconnected spanning subgraph problem