Finding the Right Cutting Planes for the TSP.

Matthew S. Levine

Published in: ACM J. Exp. Algorithmics (2000)

Keyphrases

cutting plane
integer programming
cutting plane algorithm
traveling salesman problem
lower bound
np hard
integer programming problems
mixed integer
optimal solution
knapsack problem
column generation
integer program
valid inequalities
genetic algorithm
cost function
dantzig wolfe decomposition