Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP).
William J. CookDaniel G. EspinozaMarcos GoycooleaPublished in: INFORMS J. Comput. (2007)
Keyphrases
- traveling salesman problem
- valid inequalities
- subtour elimination
- combinatorial optimization
- optimization problems
- ant colony optimization
- combinatorial optimization problems
- discrete optimization problems
- combinatorial problems
- ant colony optimization algorithm
- transportation networks
- hamiltonian cycle
- crossover operator
- objective function
- discrete particle swarm optimization
- sufficient conditions
- vehicle routing problem
- traveling salesman
- dynamic programming
- message passing