Groebner Bases and Integer Programming

ACO Student Seminar
Friday, September 21, 2012 - 13:05
1 hour (actually 50 minutes)
Skiles 005
Georgia Tech
The theory of Groebner bases is the foundation of many algorithms in computational algebra.  A Groebner basis is a special generating set of an ideal of polynomials.  In this expository talk, I will introduce Groebner bases and explain how they can be used in integer programming.   In particular, for an integer program, we can associate an ideal whose Groebner basis gives a set of directions that takes any feasible solution to an optimal solution.