Experimental analysis of heuristics for the bottleneck traveling salesman problem
From MaRDI portal
(Redirected from Publication:519098)
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
Cites work
- scientific article; zbMATH DE number 3775584 (Why is no real title available?)
- scientific article; zbMATH DE number 2064408 (Why is no real title available?)
- scientific article; zbMATH DE number 2064411 (Why is no real title available?)
- scientific article; zbMATH DE number 2064412 (Why is no real title available?)
- scientific article; zbMATH DE number 2064413 (Why is no real title available?)
- scientific article; zbMATH DE number 2064414 (Why is no real title available?)
- scientific article; zbMATH DE number 2064418 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
- Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
- Algorithms for the minimax problem of the travelling salesman. II: Dual approach
- An Algorithm for the Bottleneck Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
- An approximation algorithm for a bottleneck traveling salesman problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An efficient heuristic algorithm for the bottleneck traveling salesman problem
- Bottleneck extrema
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
- On Gilmore-Gomory's open question for the bottleneck TSP.
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- On the Maximum Scatter Traveling Salesperson Problem
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- The Bottleneck Traveling Salesman Problem
Cited in
(11)- Advancing Shannon entropy for measuring diversity in systems
- An Algorithm for the Bottleneck Traveling Salesman Problem
- scientific article; zbMATH DE number 871931 (Why is no real title available?)
- 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
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)
