When is rounding allowed in integer nonlinear optimization?
Approach to nonlinear IPs which is not based on convexity or continuity. Study of the geometric properties of the level sets and the feasible region. Special cases where rounding a continuous minimizer leads to an optimal solution. In those cases we gain an efficient algorithm for solving nonlinear IPs.
level set approach nonlinear integer optimization continuous relaxation