On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances.
Holger H. HoosThomas StützlePublished in: Optim. Lett. (2015)
Keyphrases
- finding optimal solutions
- constraint satisfaction problems
- traveling salesman problem
- optimal solution
- integer linear programming formulation
- lower bound
- combinatorial optimization
- theoretical analysis
- constraint satisfaction
- search space
- worst case
- tractable cases
- quadratic assignment problem
- space complexity
- constraint programming
- euclidean distance
- ant colony optimization
- computational complexity
- genetic algorithm
- orders of magnitude
- machine learning
- distance measure
- optimization problems
- computational cost
- np hard