Mathematikgebäude M/E19

This talk deals with the problem of optimizing nonlinear functions over the lattice points in convex or polyhedral sets. We present several polynomial time algorithms for special cases of the general problem where the number of variables is constant. Particular attention is given to nonlinear objective functions that are (quasi) convex, (quasi) concave or polynomials.

9. Kolloquium des SFB/TR 63 ``InPROMPT``

Prof. Dr. Robert Weismantel

IFOR, ETH Zürich