Sciweavers

23 search results - page 1 / 5
» Solving Integer and Disjunctive Programs by Lift and Project
Sort
View
ANOR
2005
131views more  ANOR 2005»
13 years 5 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
SIAMJO
2010
135views more  SIAMJO 2010»
13 years 3 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
MP
2011
13 years 7 days ago
Lifting for conic mixed-integer programming
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...
Alper Atamtürk, Vishnu Narayanan
JGO
2008
83views more  JGO 2008»
13 years 5 months ago
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
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...
Lewis Ntaimo, Matthew W. Tanner