The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
From MaRDI portal
Publication:336878
DOI10.1016/j.cor.2013.08.005zbMath1348.90546OpenAlexW2106727356MaRDI QIDQ336878
John LaRusic, Abraham P. Punnen
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.08.005
complexityheuristicstraveling salesman problemapproximation algorithmsexperimental analysisbottleneck problems
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items
The balanced traveling salesman problem ⋮ A branch-and-cut algorithm for the balanced traveling salesman problem ⋮ Minimizing the number of workers in a paced mixed-model assembly line ⋮ A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions ⋮ A class of exponential neighbourhoods for the quadratic travelling salesman problem ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A data-guided lexisearch algorithm for the asymmetric traveling salesman problem
- Experimental analysis of heuristics for the bottleneck traveling salesman problem
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
- Transforming asymmetric into symmetric traveling salesman problems
- Minmax strongly connected subgraphs with node penalties
- Minmax combinatorial optimization
- A short proof of Meyniel's theorem
- 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
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- An upper bound for the Hamiltonicity exponent of finite digraphs
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- The traveling salesman problem and its variations
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem
- A fast algorithm for a class of bottleneck problems
- On Hamiltonian powers of digraphs
- An efficient heuristic algorithm for the bottleneck traveling salesman problem
- An Algorithm for the Bottleneck Traveling Salesman Problem
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Minimax 2-connected subgraphs and the bottleneck traveling salesman problem
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- The Bottleneck Traveling Salesman Problem
- On the Maximum Scatter Traveling Salesperson Problem
- Bottleneck extrema
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
