Some Examples of Difficult Traveling Salesman Problems
From MaRDI portal
Cited in
(26)- On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem
- The fleet size and mix vehicle routing problem
- How easy is local search?
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
- Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
- A probabilistic analysis of the switching algorithm for the Euclidean TSP
- On minimal Eulerian graphs
- Optimization, approximation, and complexity classes
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- Optimal arcs for the traveling salesman problem
- Traveling salesman problem and local search
- Local search and the local structure of NP-complete problems
- An empirical study of a new metaheuristic for the traveling salesman problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Measuring instance difficulty for combinatorial optimization problems
- Data-independent neighborhood functions and strict local optima
- k-interchange procedures for local search in a precedence-constrained routing problem
- Polynomial transformations and data-independent neighborhood functions
- HAMILTONian circuits in chordal bipartite graphs
- Knowing all optimal solutions does not help for TSP reoptimization
- On the refinement of bounds of heuristic algorithms for the traveling salesman problem
- Hill Climbing with Multiple Local Optima
- Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
- Change ringing and Hamiltonian cycles: the search for Erin and Stedman triples
- On the Hardness of Reoptimization
- On the number of iterations of local improvement algorithms
This page was built for publication: Some Examples of Difficult Traveling Salesman Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4162995)
