An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack

Details An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack

2010-05-18

arxiv.org/abs/1005.3324v2

Computer Science

Discrete Mathematics

Scientific paper

In this note we study packing or covering integer programs with at most k constraints, which are also known as k-dimensional knapsack problems. For any integer k > 0 and real epsilon > 0, we observe there is a polynomial-sized LP for the k-dimensional knapsack problem with integrality gap at most 1+epsilon. The variables may be unbounded or have arbitrary upper bounds. In the packing case, we can also remove the dependence of the LP on the cost-function, yielding a polyhedral approximation of the integer hull. This generalizes a recent result of Bienstock on the classical knapsack problem.

Affiliated with

Also associated with

No associations

Rating

An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack 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 An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-477802