2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture.
Frans SchalekampDavid P. WilliamsonAnke van ZuylenPublished in: Math. Oper. Res. (2014)
Keyphrases
- traveling salesman problem
- subtour elimination
- valid inequalities
- lp relaxation
- combinatorial optimization
- optimization problems
- linear programming
- ant colony optimization
- linear program
- combinatorial optimization problems
- hamiltonian cycle
- transportation networks
- combinatorial problems
- ant colony optimization algorithm
- traveling salesman
- vehicle routing problem
- genetic local search
- neural network
- crossover operator
- discrete optimization problems
- objective function
- integer programming
- bipartite graph
- message passing
- np complete