Mixed-integer sets from two rows of two adjacent simplex bases.
Kent AndersenQuentin LouveauxRobert WeismantelPublished in: Math. Program. (2010)
Keyphrases
- mixed integer
- totally unimodular
- linear program
- feasible solution
- linear programming
- lot sizing
- convex hull
- benders decomposition
- simplex method
- mixed integer programming
- optimal solution
- continuous relaxation
- continuous variables
- lagrangian heuristic
- linear programming problems
- second order cone program
- multistage
- lower bound
- convex sets
- network design problem
- supply chain
- mixed integer program
- feature space
- bayesian networks