On the empirical scaling of running time for finding optimal solutions to the TSP.
Zongxu MuJérémie Dubois-LacosteHolger H. HoosThomas StützlePublished in: J. Heuristics (2018)
Keyphrases
- finding optimal solutions
- traveling salesman problem
- constraint satisfaction problems
- lower bound
- theoretical analysis
- search space
- ant colony optimization
- combinatorial optimization
- neural network
- genetic algorithm
- optimal solution
- optimization problems
- information theoretic
- traveling salesman
- travelling salesman