Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints.
Tobias FischerMarc E. PfetschPublished in: Oper. Res. Lett. (2017)
Keyphrases
- mixed integer
- linear program
- lot sizing
- mixed integer programming
- linear programming problems
- mixed integer program
- cutting plane
- optimal solution
- benders decomposition
- feasible solution
- facet defining inequalities
- valid inequalities
- continuous relaxation
- continuous variables
- convex hull
- network design problem
- decision making
- lagrangian heuristic
- integer variables
- multistage
- maximum likelihood
- search algorithm
- objective function