✦ LIBER ✦

Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs

✍ Scribed by Lewis Ntaimo; Matthew W. Tanner

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 300 KB
Volume: 41
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-007-9245-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing deep facet-defining disjunctiv

Computing deep facet-defining disjunctive cuts for mixed-integer programming

✍ Florent Cadoux 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 453 KB

Decomposition with branch-and-cut approa

Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming

✍ Suvrajeet Sen; Hanif D. Sherali 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 188 KB

A cutting-plane approach to mixed 0–1 st

A cutting-plane approach to mixed 0–1 stochastic integer programs

✍ Claus C. Carøe; Jørgen Tind 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 773 KB

We consider a mixed 0-1 integer programming problem with dual block-angular structure arising in two-stage stochastic programming. A relaxation is proposed such that the problem is decomposed into subproblems each corresponding to the outcomes of the random variable. The convex hull of feasible solu

Perspective cuts for a class of convex 0

Perspective cuts for a class of convex 0–1 mixed integer programs

✍ A. Frangioni; C. Gentile 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 170 KB

A precise correspondence between lift-an

A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming

✍ Egon Balas; Michael Perregaard 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 187 KB

A recursive procedure to generate all cu

A recursive procedure to generate all cuts for 0–1 mixed integer programs

✍ George L. Nemhauser; Laurence A. Wolsey 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 451 KB