Aarhus University Seal / Aarhus Universitets segl

About optimization of nonlinear functions over integer points in polyhedra

Robert Weismantel
(ETH, Zurich)
Onsdag, 25 maj, 2011, at 11:15-12:15, Turing 014, Department of Computer Science
This talk deals with the problem of optimizing nonlinear functions over the lattice points in a polyhedral set. We present families of polynomial time algorithms for special cases of the general problem. Each such algorithm makes use of combinatorial, algebraic or geometric properties of the underlying problem. A particular focus of the talk concerns the special case when we aim at minimizing a nonlinear convex objective function.
Kontaktperson: Kent Andersen