A dual heuristic for mixed integer programming.

Yaxian Li Özlem Ergun George L. Nemhauser

Published in: Oper. Res. Lett. (2015)

Keyphrases

mixed integer programming
branch and bound method
lot sizing
column generation
production planning
mixed integer
lagrangian relaxation
valid inequalities
network design problem
dantzig wolfe decomposition
linear programming relaxation
linear program
primal dual
decision trees
fixed cost