1274 search results - page 2 / 255 » N-fold integer programming |
140
Voted
IOR
2011
14 years 8 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...
72
Voted
EUROGP
2004
Springer
15 years 6 months ago
2004
Springer
85
Voted
IPCO
2007
15 years 2 months ago
2007
INFORMS
2000
15 years 28 days ago
2000
106
Voted
CPAIOR
2007
Springer
15 years 7 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...