Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs.
Anureet SaxenaPierre BonamiJon LeePublished in: IPCO (2008)
Keyphrases
- mixed integer
- convex hull
- quadratic program
- benders decomposition
- linear program
- mixed integer programming
- feasible solution
- lot sizing
- linear programming problems
- continuous relaxation
- network design problem
- optimal solution
- cutting plane
- convex sets
- convex optimization
- continuous variables
- lagrangian heuristic
- convex functions
- interior point methods
- valid inequalities
- linear programming