Computing the Integer Programming Gap

Details Computing the Integer Programming Gap Computing the Integer Programming Gap

2003-01-23

arxiv.org/abs/math/0301266v1

Mathematics

Optimization and Control

17 Pages

Scientific paper

We determine the maximal gap between the optimal values of an integer program
and its linear programming relaxation, where the matrix and cost function are
fixed but the right hand side is unspecified. Our formula involves irreducible
decomposition of monomial ideals. The gap can be computed in polynomial time
when the dimension is fixed.

Affiliated with

Also associated with

No associations

Rating

Computing the Integer Programming Gap 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 Computing the Integer Programming Gap, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the Integer Programming Gap will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-74395