Rounding-based heuristics for nonconvex MINLPs.
Giacomo NanniciniPietro BelottiPublished in: Math. Program. Comput. (2012)
Keyphrases
- mixed integer
- linear programming
- global optimization
- nonlinear programming
- linear program
- approximation algorithms
- objective function
- heuristic search
- convex hull
- tight upper and lower bounds
- lot sizing
- feasible solution
- search algorithm
- neural network
- data sets
- optimization problems
- linear programming relaxation
- optimal solution
- greedy heuristics