An efficient heuristic algorithm for the bottleneck traveling salesman problem
From MaRDI portal
Publication:2269075
DOI10.1007/s12597-009-0018-xzbMath1188.90219OpenAlexW1997470528MaRDI QIDQ2269075
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Unified encoding for hyper-heuristics with application to bioinformatics ⋮ The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ Advancing Shannon entropy for measuring diversity in systems ⋮ Experimental analysis of heuristics for the bottleneck traveling salesman problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Experimental analysis of heuristics for the bottleneck traveling salesman problem
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
- A linear time algorithm for the maximum capacity path problem
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- On the bottleneck linear programming problem
- The Min-Max Spanning Tree Problem and some extensions
- A procedure for time minimization transportation problem
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A fast algorithm for a class of bottleneck problems
- An Algorithm for the Bottleneck Traveling Salesman Problem
- The Constrained Bottleneck Problem in Networks
- Solving 0-1 Minimax Problems
- Algorithms for two bottleneck optimization problems
- Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
- The Bottleneck Traveling Salesman Problem
- Bottleneck extrema
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- The bottleneck transportation problem