An Algorithm for the Bottleneck Traveling Salesman Problem

DOI10.1287/OPRE.32.2.380MaRDI QIDQ3328310zbMATH OpenOpenAlexFDO

Authors Giorgio Carpaneto, Silvano Martello, Paolo Toth

Publication date 1984

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.32.2.380

zbMATH Keywords

Bottleneck ArborescenceBottleneck Assignmentbottleneck traveling salesman problembreadth- first branch and bound algorithmcomputational resultdirected Hamiltonian circuitheuristic searchlower boundstest problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Numerical mathematical programming methods (65K05) Graph theory (including graph drawing) in computer science (68R10) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• An efficient heuristic algorithm for the bottleneck traveling salesman problem
• Experimental analysis of heuristics for the bottleneck traveling salesman problem
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
• A data-guided lexisearch algorithm for the bottleneck travelling salesman problem
• An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices

Cited in

(16)

• An approximation algorithm for a bottleneck traveling salesman problem
• Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem
• Most and least uniform spanning trees
• A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
• Efficiently solvable special cases of bottleneck travelling salesman problems
• An additive bounding procedure for the asymmetric travelling salesman problem
• An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
• On Gilmore-Gomory's open question for the bottleneck TSP.
• A data-guided lexisearch algorithm for the bottleneck travelling salesman problem
• An efficient heuristic algorithm for the bottleneck traveling salesman problem
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
• An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
• scientific article; zbMATH DE number 4031726 (Why is no real title available?)
• Experimental analysis of heuristics for the bottleneck traveling salesman problem
• scientific article; zbMATH DE number 7059568 (Why is no real title available?)
• Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies

This page was built for publication: An Algorithm for the Bottleneck Traveling Salesman Problem

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