Partial convexification cuts for 0-1 mixed-integer programs.

Hanif D. Sherali Youngho Lee Youngjin Kim

Published in: Eur. J. Oper. Res. (2005)

Keyphrases

mixed integer program
feasible solution
mixed integer
cutting plane
lot sizing
linear program
linear programming relaxation
linear programming
valid inequalities
lagrangian relaxation
lower bound
special case
mixed integer programming