Hard to Solve Instances of the Euclidean Traveling Salesman Problem.
Stefan HougardyXianghui ZhongPublished in: CoRR (2018)
Keyphrases
- traveling salesman problem
- discrete optimization problems
- valid inequalities
- benchmark instances
- combinatorial optimization
- lin kernighan
- ant colony optimization
- combinatorial problems
- combinatorial optimization problems
- vehicle routing problem
- discrete particle swarm optimization
- ant colony optimization algorithm
- traveling salesman
- hamiltonian cycle
- optimization problems
- genetic local search
- integer programming
- euclidean distance