- Series
- ACO Student Seminar
- Time
- Friday, September 21, 2012 - 1:05pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Josephine Yu – Georgia Tech – http://people.math.gatech.edu/~jyu67/Josephine_Yu/Main.html
- Organizer
- Chun-hung Liu
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.