Experimental analysis of heuristics for the bottleneck traveling salesman problem
DOI10.1007/S10732-012-9194-6zbMATH Open1358.90170OpenAlexW1995945236MaRDI QIDQ519098FDOQ519098
Authors: John LaRusic, Abraham P. Punnen, Eric Aubanel 
Publication date: 4 April 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-012-9194-6
Recommendations
- An efficient heuristic algorithm for the bottleneck traveling salesman problem
- An Algorithm for the Bottleneck Traveling Salesman Problem
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
- Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem
- A data-guided lexisearch algorithm for the bottleneck travelling salesman problem
traveling salesman problemexperimental analysisheuristic algorithmsbottleneck TSPmaximum scatter TSP
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Title not available (Why is that?)
- Bottleneck extrema
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
- The Bottleneck Traveling Salesman Problem
- Title not available (Why is that?)
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
- An efficient heuristic algorithm for the bottleneck traveling salesman problem
- Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem
- An Algorithm for the Bottleneck Traveling Salesman Problem
- Title not available (Why is that?)
- On the Maximum Scatter Traveling Salesperson Problem
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- An approximation algorithm for a bottleneck traveling salesman problem
- On Gilmore-Gomory's open question for the bottleneck TSP.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for the minimax problem of the travelling salesman. II: Dual approach
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Advancing Shannon entropy for measuring diversity in systems
- An Algorithm for the Bottleneck Traveling Salesman Problem
- Title not available (Why is that?)
- Unified encoding for hyper-heuristics with application to bioinformatics
- A data-guided lexisearch algorithm for the bottleneck travelling 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 efficient heuristic algorithm for the bottleneck traveling salesman problem
- A class of exponential neighbourhoods for the quadratic travelling salesman problem
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions
- Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem
Uses Software
This page was built for publication: Experimental analysis of heuristics 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 Q519098)
