A lift-and-project cutting plane algorithm for mixed 0-1 programs.

Egon Balas Sebastián Ceria Gérard Cornuéjols

Published in: Math. Program. (1993)

Keyphrases

cutting plane algorithm
cutting plane
integer programming
maximum margin
valid inequalities
column generation
routing problem
max flow
traveling salesman problem
computational complexity
maximum likelihood
integer program
linear svm