The Graver Complexity of Integer Programming

Details The Graver Complexity of Integer Programming The Graver Complexity of Integer Programming

2007-09-10

arxiv.org/abs/0709.1500v2

Annals of Combinatorics, 13:289--296, 2009

Mathematics

Combinatorics

Improved Bound $\Omega(2^m)$

Scientific paper

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 $K_{3,m}$ satisfies $g(m)=\Omega(2^m)$, with $g(m)\geq 17\cdot 2^{m-3}-7$ for every $m>3$ .

Affiliated with

Also associated with

No associations

Rating

The Graver Complexity of Integer Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Graver Complexity of Integer Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Graver Complexity of Integer Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-391287