Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


Groebner Bases Methods in Integer Programming

Groebner Bases Methods in Integer Programming Rekha Thomas, Mathematics, University of Washington, Seattle This talk will be a survey of the methods and results in parametric integer programming that have been obtained by algebraic methods centered around Groebner bases. Algebraic techniques offer new insights into the structure of integer programs, most notably about group relaxations of integer programs and sensitivity analysis for these problems. Via recent results of Barvinok and Woods they also offer a new proof that integer programs can be solved in polynomial time when the dimension is fixed. No prior knowledge of these methods is assumed.
Type of Seminar:
Public Seminar
Prof. Rekha Thomas
Mathematics University of Washington, Seattle, USA
Nov 26, 2003   17:15

ETH Zentrum, Gloriastrasse 35, Building ETZ, Room E9
Contact Person:

Prof. P. Parrilo
No downloadable files available.
Biographical Sketch:
Rekha Thomas is an associate professor of Mathematics at the University of Washington in Seattle. She obtained her Ph.D. in 1994 under the supervision of Bernd Sturmfels at Cornell University. She has held postdoctoral positions at Yale University and ZIB-Berlin. Her research interests are in discrete optimization and computational algebra.