Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets.
Kwanghun ChungJean-Philippe P. RichardMohit TawarmalaniPublished in: Math. Program. (2014)
Keyphrases
- mixed integer
- totally unimodular
- valid inequalities
- lot sizing
- mixed integer programming
- linear program
- benders decomposition
- convex hull
- feasible solution
- cutting plane
- optimal solution
- network design problem
- continuous relaxation
- facet defining inequalities
- continuous variables
- cutting plane algorithm
- linear programming
- objective function
- multistage
- lead time
- message passing
- quadratic program
- graphical models
- probability distribution
- dynamic programming
- evolutionary algorithm
- genetic algorithm