Strong-branching inequalities for convex mixed integer nonlinear programs.
Mustafa R. KilinçJeff T. LinderothJames R. LuedtkeAndrew MillerPublished in: Comput. Optim. Appl. (2014)
Keyphrases
- mixed integer
- quadratic program
- convex hull
- valid inequalities
- linear program
- feasible solution
- benders decomposition
- integer variables
- continuous relaxation
- lot sizing
- mixed integer programming
- optimal solution
- continuous variables
- cutting plane
- branch and bound
- linear programming problems
- facet defining inequalities
- piecewise linear
- network design problem
- convex sets
- convex functions
- training samples
- linear programming
- dynamic programming
- np hard
- genetic algorithm