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