Column basis reduction, and decomposable knapsack problems

Details Column basis reduction, and decomposable knapsack problems Column basis reduction, and decomposable knapsack problems

2008-07-08

arxiv.org/abs/0807.1317v2

Discrete Optimization Volume 6, Issue 3, August 2009, Pages 242-270

Mathematics

Optimization and Control

Scientific paper

We propose a very simple preconditioning method for integer programming feasibility problems: replacing the problem b' <= Ax <= b, x \in Z^n with b' <= AUy <= b, y \in Z^n, where U is a unimodular matrix computed via basis reduction, to make the columns of $AU$ short and nearly orthogonal. The reformulation is called rangespace reformulation. It is motivated by the reformulation technique proposed for equality constrained IPs by Aardal, Hurkens and Lenstra. We also study a family of IP instances, called decomposable knapsack problems (DKPs). DKPs generalize the instances proposed by Jeroslow, Chvatal and Todd, Avis, Aardal and Lenstra, and Cornuejols et al. DKPs are knapsack problems with a constraint vector of the form $pM + r, $ with $p >0$ and $r$ integral vectors, and $M$ a large integer. If the parameters are suitably chosen in DKPs, we prove 1) hardness results for these problems, when branch-and-bound branching on individual variables is applied; 2) that they are easy, if one branches on the constraint $px$ instead; and 3) that branching on the last few variables in either the rangespace- or the AHL-reformulations is equivalent to branching on $px$ in the original problem. We also provide recipes to generate such instances. Our computational study confirms that the behavior of the studied instances in practice is as predicted by the theoretical results.

Affiliated with

Also associated with

No associations

Rating

Column basis reduction, and decomposable knapsack problems 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 Column basis reduction, and decomposable knapsack problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Column basis reduction, and decomposable knapsack problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-269514