Solving Lift-and-Project Relaxations of Binary Integer Programs.

Samuel Burer Dieter Vandenbussche

Published in: SIAM J. Optim. (2006)

Keyphrases

integer program
linear programming relaxation
lp relaxation
linear program
column generation
integer programming
cutting plane
linear programming
multistage stochastic
np hard
network flow
lower bound
case study
valid inequalities
project management
knapsack problem
software development
convex relaxation