✦ LIBER ✦

Solving 0/1 integer programs with enumeration cutting planes

✍ Scribed by E. Andrew Boyd

Book ID: 112691251
Publisher: Springer US
Year: 1994
Tongue: English
Weight: 876 KB
Volume: 50
Category: Article
ISSN: 0254-5330
DOI: 10.1007/bf02085635

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cutting planes for integer programs with

Cutting planes for integer programs with general integer variables

✍ Sebastián Ceria; Cécile Cordier; Hugues Marchand; Laurence A. Wolsey 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 795 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

Higher-level RLT or disjunctive cuts bas

Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs

✍ Hanif D. Sherali; J. Cole Smith 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 198 KB

Computations with disjunctive cuts for t

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

✍ Lewis Ntaimo; Matthew W. Tanner 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 300 KB

Dynamic Lagrangian dual and reduced RLT

Dynamic Lagrangian dual and reduced RLT constructs for solving 0–1 mixed-integer programs

✍ Hanif D. Sherali; J. Cole Smith 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 576 KB

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