Integer Polynomial Programming
Robert Weismantel, Otto-von-Guericke Universität Magdeburg
This talk deals with integer polynomial optimization problems and its
generalization to mixed integer programming.
We present motivating examples, illustrate techniques that reduce
the problem to a mixed integer linear program and discuss complexity results.
For the special case of when the number of variables is fixed,
we present an algorithm based on rational functions.
The first part of the talk is based on joint work with Dennis Michaels.
The second part is based on joint work with Jesus De Loera, Raymond Hemmecke
and Matthias Koeppe.
Chemnitz Workshop
Last modified: Tue Oct 5 8:13:51 CEST 2004