On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"
Moustapha DiabyPublished in: CoRR (2006)
Keyphrases
- traveling salesman problem
- linear programming
- valid inequalities
- quadratic programming
- lp relaxation
- linear program
- combinatorial optimization
- ant colony optimization
- subtour elimination
- combinatorial problems
- ant colony optimization algorithm
- feasible solution
- optimization problems
- transportation networks
- traveling salesman
- discrete optimization problems
- vehicle routing problem
- crossover operator
- hamiltonian cycle
- integer programming
- mixed integer
- np hard
- integer program
- combinatorial optimization problems
- column generation
- global optimization
- dynamic programming
- evolutionary algorithm
- optimal solution
- objective function
- genetic algorithm
- lagrangian relaxation
- convex hull
- search algorithm