133
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...