1274 search results - page 3 / 255 » N-fold integer programming |
MP
2011
13 years 1 months ago
2011
Lifting is a procedure for deriving valid inequalities for mixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very e...
WADS
2009
Springer
14 years 25 days 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...
ORL
2008
13 years 6 months ago
2008
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...
EMNLP
2006
13 years 7 months ago
2006
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
ANOR
2005
13 years 6 months ago
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...