Undercover: a primal MINLP heuristic exploring a largest sub-MIP.
Timo BertholdAmbros M. GleixnerPublished in: Math. Program. (2014)
Keyphrases
- mixed integer
- mixed integer programming
- linear program
- feasible solution
- linear programming
- optimal solution
- second order cone program
- network design problem
- mixed integer nonlinear programming
- semi infinite
- valid inequalities
- column generation
- objective function
- lot sizing
- cutting plane
- heuristic solution
- primal dual
- linear programming problems
- dynamic programming
- support vector
- np hard
- mixed integer linear programming
- continuous variables
- lagrangian relaxation
- interior point methods
- genetic algorithm
- lp relaxation
- integer programming
- quadratic program
- upper bound
- metaheuristic
- multistage
- single commodity
- exact solution
- convex hull