On reduction integer programs to knapsack problem

Details On reduction integer programs to knapsack problem On reduction integer programs to knapsack problem

2008-06-24

arxiv.org/abs/0806.3853v1

Mathematics

Optimization and Control

Scientific paper

Let $A$ be an integral nonnegative $m\times n$ matrix, $b$ be an integral
nonnegative vector. It is suggested new method for reduction of integer program
$\max \{cx| Ax=b, x\ge 0, x\in\mathbf{Z}^n\}$ to knapsack problem $\max \{c'x|
fAx=fb, x\ge 0, x\in\mathbf{Z}^n\}$.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-97455