Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra.
Sanjeeb DashSantanu S. DeyOktay GünlükPublished in: Math. Program. (2012)
Keyphrases
- mixed integer
- convex hull
- linear program
- benders decomposition
- mixed integer programming
- cutting plane
- continuous relaxation
- feasible solution
- lot sizing
- extreme points
- optimal solution
- valid inequalities
- continuous variables
- convex sets
- network design problem
- lagrangian heuristic
- mixed integer program
- linear programming
- evolutionary algorithm