Gröbner Bases in Integer Programming

Recently, application of the theory of Grobner bases to integer programming has given rise to new tools and results in this field. Here we present this algebraic theory as the natural integer analog of the simplex approach to linear programming Although couched in algebra, the theory of Grobner bases and its consequences for integer programming are intimately intertwined with polyhedral geometry and lattice arithmetic which are staples of the traditional approach to this subject.

[1]  Jack E. Graver,et al.  On the foundations of linear and integer linear programming I , 1975, Math. Program..

[2]  A. Buckley,et al.  An alternate implementation of Goldfarb's minimization algorithm , 1975, Math. Program..

[3]  Charles E. Blair,et al.  The value function of an integer program , 1982, Math. Program..

[4]  Herbert E. Scarf,et al.  Neighborhood Systems for Production Sets with Indivisibilities , 1986 .

[5]  William J. Cook,et al.  Sensitivity theorems in integer linear programming , 1986, Math. Program..

[6]  Teo Mora,et al.  The Gröbner Fan of an Ideal , 1988, J. Symb. Comput..

[7]  Ian Morrison,et al.  Standard Bases and Geometric Invariant Theory I. Initial Ideals and State Polytopes , 1988, J. Symb. Comput..

[8]  Bernd Sturmfels,et al.  Constructions and complexity of secondary polytopes , 1990 .

[9]  B. Sturmfels.  Gröbner bases of toric varieties , 1991 .

[10]  Carlo Traverso,et al.  Buchberger Algorithm and Integer Programming , 1991, AAECC.

[11]  B. Sturmfels.  Asymptotic analysis of toric ideals , 1992 .

[12]  Bernd Sturmfels,et al.  Duality and Minors of Secondary Polyhedra , 1993, J. Comb. Theory, Ser. B.

[13]  W. Fulton.  Introduction to Toric Varieties. , 1993 .

[14]  William Fulton,et al.  Introduction to Toric Varieties. (AM-131) , 1993 .

[15]  G. Ziegler.  Lectures on Polytopes , 1994 .

[16]  B. Sturmfels.  Gröbner bases and convex polytopes , 1995 .

[17]  Rekha R. Thomas.  A Geometric Buchberger Algorithm for Integer Programming , 1995, Math. Oper. Res..

[18]  Rüdiger L. Urbanke,et al.  An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms , 1995, Exp. Math..

[19]  Rekha R. Thomas,et al.  Gröbner bases and triangulations of the second hypersimplex , 1995, Comb..

[20]  Bernd Sturmfels,et al.  GRIN: An Implementation of Gröbner Bases for Integer Programming , 1995, IPCO.

[21]  Rekha R. Thomas,et al.  An algebraic geometry algorithm for scheduling in presence of setups and correlated demands , 1995, Math. Program..

[22]  Rekha R. Thomas,et al.  Truncated Gröbner Bases for Integer Programming , 1997, Applicable Algebra in Engineering, Communication and Computing.

[23]  Laurence A. Wolsey,et al.  Decomposition of Integer Programs and of Generating Sets , 1997, ESA.

[24]  Rekha R. Thomas,et al.  Variation of cost functions in integer programming , 1997, Math. Program..

[25]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[26]  Rekha R. Thomas,et al.  Gröbner Bases and Applications: Gröbner Bases and Integer Programming , 1998 .

[27]  P. Diaconis,et al.  Algebraic algorithms for sampling from conditional distributions , 1998 .

[28]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.