An efficient heuristic algorithm for the bottleneck traveling salesman problem

DOI10.1007/S12597-009-0018-XMaRDI QIDQ2269075zbMATH OpenOpenAlexFDO

Authors Ravi Ramakrishnan, Prabha Sharma, Abraham P. Punnen

Publication date 15 March 2010

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12597-009-0018-x

zbMATH Keywords

combinatorial optimizationtraveling salesman problemexperimental analysisbottleneck problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• An Algorithm for the Bottleneck Traveling Salesman Problem
• An approximation algorithm for a bottleneck traveling salesman problem
• An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
• A new heuristic for the traveling salesman problem
• Experimental analysis of heuristics for the bottleneck traveling salesman problem
• Efficiently solvable special cases of bottleneck travelling salesman problems
• scientific article; zbMATH DE number 238296
• A linearithmic heuristic for the travelling salesman problem
• A multiperiod traveling salesman problem: Heuristic algorithms
• A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks

Cites work

• scientific article; zbMATH DE number 3775584 (Why is no real title available?)
• scientific article; zbMATH DE number 2064412 (Why is no real title available?)
• scientific article; zbMATH DE number 2064418 (Why is no real title available?)
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• A fast algorithm for a class of bottleneck problems
• A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
• A linear time algorithm for the maximum capacity path problem
• A procedure for time minimization transportation problem
• Algorithms for two bottleneck optimization problems
• An Algorithm for the Bottleneck Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Bottleneck extrema
• Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
• Experimental analysis of heuristics for the bottleneck traveling salesman problem
• Guaranteed performance heuristics for the bottleneck traveling salesman problem
• On the bottleneck linear programming problem
• Solving 0-1 Minimax Problems
• The Bottleneck Traveling Salesman Problem
• The Constrained Bottleneck Problem in Networks
• The Min-Max Spanning Tree Problem and some extensions
• The bottleneck transportation problem

Cited in

(10)

• Advancing Shannon entropy for measuring diversity in systems
• An Algorithm for the Bottleneck Traveling Salesman Problem
• Unified encoding for hyper-heuristics with application to bioinformatics
• A data-guided lexisearch algorithm for the bottleneck travelling salesman problem
• Experimental analysis of heuristics for the bottleneck traveling salesman problem
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
• An approximation algorithm for a bottleneck traveling salesman problem
• Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem

Describes a project that uses

Uses Software

• Concorde
• LKH
• TSPLIB

This page was built for publication: An efficient heuristic 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 Q2269075)