The Bottleneck Traveling Salesman Problem

DOI10.1145/322077.322086MaRDI QIDQ4159199zbMATH OpenOpenAlexWikidataFDO

Authors Robert Garfinkel, K. C. Gilbert

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

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

Cited in

(16)

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

This page was built for publication: The Bottleneck Traveling Salesman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159199)