论文信息 - The Graver Complexity of Integer Programming

The Graver Complexity of Integer Programming

In this article we establish an exponential lower bound on the Graver complexity of integer programs. This provides new type of evidence supporting the presumable intractability of integer programming. Specifically, we show that the Graver complexity of the incidence matrix of the complete bipartite graph K3,m satisfies g(m) = Ω(2m), with g(m) ≥ 17·2m−3 –7 for every m > 3.

Shmuel Onn | Yael Berstein | S. Onn | Yael Berstein

[1] A. Takemura,et al. Minimal Basis for a Connected Markov Chain over 3 × 3 ×K Contingency Tables with Fixed Two‐Dimensional Marginals , 2003 .

[2] Jesús A. De Loera,et al. All Linear and Integer Programs Are Slim 3-Way Transportation Programs , 2006, SIAM J. Optim..

[3] Jesús A. De Loera,et al. N-fold integer programming , 2006, Discret. Optim..

[4] Bernd Sturmfels,et al. Higher Lawrence configurations , 2003, J. Comb. Theory, Ser. A.

[5] Raymond Hemmecke,et al. On the Gröbner complexity of matrices , 2009 .

[6] P. Gordan. Ueber die Auflösung linearer Gleichungen mit reellen Coefficienten , 1873 .

[7] Jesús A. De Loera,et al. Markov bases of three-way tables are arbitrarily complicated , 2006, J. Symb. Comput..

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

[9] B. Sturmfels. Gröbner bases and convex polytopes , 1995 .

[10] On the Gr\"obner complexity of matrices , 2007, 0708.4392.