1707 search results - page 4 / 342 » Early Integer Programming |
67
Voted
IPCO
2007
14 years 11 months ago
2007
74
Voted
INFORMS
2000
14 years 9 months ago
2000
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
110
click to vote
MP
2011
14 years 4 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
15 years 4 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...