A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem.
Abraham P. PunnenBrad D. WoodsSantosh N. KabadiPublished in: CoRR (2017)
Keyphrases
- traveling salesman problem
- valid inequalities
- benchmark instances
- quadratic assignment problem
- combinatorial optimization
- lin kernighan
- combinatorial optimization problems
- ant colony optimization
- optimization problems
- traveling salesman
- ant colony optimization algorithm
- hamiltonian cycle
- discrete optimization problems
- crossover operator
- combinatorial problems
- vehicle routing problem
- discrete particle swarm optimization
- pairwise
- computational complexity
- objective function
- randomly generated
- test instances
- subtour elimination
- genetic local search
- tabu search
- shortest path
- constraint satisfaction problems
- optimal solution
- similarity measure