1274 search results - page 2 / 255 » N-fold integer programming |
202
click to vote
IOR
2011
15 years 1 months ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
136
Voted
IPCO
2007
15 years 7 months ago
2007
161
click to vote
CPAIOR
2007
Springer
16 years 9 days 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...