156 search results - page 1 / 32 » A cutting plane method for solving linear generalized disjun... |
75
Voted
CCE
2005
14 years 10 months ago
2005
JGO
2008
14 years 10 months ago
2008
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
116
Voted
IOR
2011
14 years 5 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...
83
Voted
CPAIOR
2010
Springer
15 years 1 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
96
Voted
SIAMJO
2000
14 years 10 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...