On branching rules for convex mixed-integer nonlinear optimization.
Pierre BonamiJon LeeSven LeyfferAndreas WächterPublished in: ACM J. Exp. Algorithmics (2013)
Keyphrases
- mixed integer
- nonlinear optimization
- convex hull
- starting points
- feasible solution
- quadratic program
- lot sizing
- optimal solution
- linear program
- optimization method
- branch and bound
- linear programming problems
- continuous variables
- bundle adjustment
- convex optimization
- global search
- closed form solutions
- convex sets
- semi supervised
- cost function