Binary extended formulations of polyhedral mixed-integer sets.
Sanjeeb DashOktay GünlükRobert HildebrandPublished in: Math. Program. (2018)
Keyphrases
- mixed integer
- convex hull
- valid inequalities
- mixed integer linear programming
- totally unimodular
- convex sets
- linear program
- binary variables
- lot sizing
- benders decomposition
- mixed integer programming
- cutting plane
- feasible solution
- continuous relaxation
- optimal solution
- network design problem
- mixed integer program
- lagrangian heuristic
- continuous variables
- linear programming
- quadratic program