Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem
Radoslaw HofmanPublished in: CoRR (2006)
Keyphrases
- traveling salesman problem
- linear programming
- valid inequalities
- quadratic programming
- combinatorial optimization
- subtour elimination
- lp relaxation
- ant colony optimization
- optimization problems
- combinatorial problems
- transportation networks
- ant colony optimization algorithm
- linear program
- vehicle routing problem
- combinatorial optimization problems
- discrete particle swarm optimization
- traveling salesman
- optimal solution
- discrete optimization problems
- dynamic programming
- hamiltonian cycle
- objective function
- genetic local search
- network flow
- crossover operator
- metaheuristic
- np hard
- feasible solution
- column generation
- integer programming
- branch and bound algorithm
- particle swarm optimization