Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming.
Jonathan EcksteinMikhail NediakPublished in: J. Heuristics (2007)
Keyphrases
- mixed integer programming
- branch and bound method
- column generation
- mixed integer
- production planning
- lagrangian relaxation
- lot sizing
- dantzig wolfe decomposition
- linear programming relaxation
- network design problem
- valid inequalities
- feasible solution
- fixed cost
- optimal solution
- linear program
- integer programming
- mathematical model
- random variables
- reinforcement learning