An Effective Theory of Integer Optimization

In recent years we have developed a theory that uses Graver bases (certain universal Grobner bases) to solve broad linear and nonlinear integer optimization problems in polynomial time. In the first part of the talk I will overview some of the basics of this theory and its generic application to multiway tables (tensors). In the second part I will describe very recent work that unifies and broadly extends and accelerates this theory.