The Graver complexity of integer programming

Annals of Combinatorics

Volumn 13, Issue 3, 2009, Pages 289-296

  Berstein, Yael ^a   Onn, Shmuel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Computational complexity; Contingencytable; Graver basis; Graver complexity; Gr bner basis; Integer programming; Markov complexity; Transportation polytope; Transportation problem

Indexed keywords

EID: 70449529528     PISSN: 02180006     EISSN: 02193094     Source Type: Journal    
DOI: 10.1007/s00026-009-0029-6     Document Type: Article

References (9)

1. Aoki S., Takemura A.: Minimal basis for connected Markov chain over 3 × 3 × k contingency tables with fixed two-dimensional marginals. Aust. N. Z. J. Stat. 45, 229-249 (2003).
2. De Loera J., Hemmecke R., Onn S., Weismantel R.: N-fold integer programming. Discrete Optim. 5, 231-241 (2008).
3. De Loera J., Onn S.: All linear and integer programs are slim 3-way transportation programs. SIAM J. Optim. 17, 806-821 (2006).
4. De Loera J., Onn S.: Markov bases of three-way tables are arbitrarily complicated. J. Symbolic Comput. 41, 173-181 (2006).
5. Gordan P.: Über die Auflösung linearer Gleichungen mit reellen Coefficienten. Math. Ann. 6, 23-28 (1873).
6. Graver J.E.: On the foundations of linear and integer programming. Math. Program. 9, 207-226 (1975).
7. Hemmecke R., Nairn K.A.: On the Gröbner complexity of matrices. J. Pure Appl. Algebra 213, 1558-1563 (2009).
8. Santos F., Sturmfels B.: Higher Lawrence configurations. J. Combin. Therory Ser. A 103, 151-164 (2003).
9. Sturmfels B.: Gröbner Bases and Convex Polytopes. American Mathematical Society, Providence (1996).