1274 search results - page 2 / 255 » N-fold integer programming |
IOR
2011
13 years 11 days 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...
EUROGP
2004
Springer
13 years 10 months ago
2004
Springer
IPCO
2007
13 years 6 months ago
2007
INFORMS
2000
13 years 5 months ago
2000
CPAIOR
2007
Springer
13 years 11 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...