FPTAS for mixed-integer polynomial optimization with a fixed number of variables.
Jesús A. De LoeraRaymond HemmeckeMatthias KöppeRobert WeismantelPublished in: SODA (2006)
Keyphrases
- fixed number
- mixed integer
- continuous variables
- np hardness
- global optimization problems
- quadratic program
- discrete variables
- linear program
- binary variables
- benders decomposition
- convex hull
- feasible solution
- continuous relaxation
- finite number
- network design problem
- optimal solution
- lot sizing
- mixed integer programming
- integer variables
- optimization problems
- lagrangian heuristic
- linear programming
- lower bound
- bayesian networks
- computationally expensive
- dual variables