✦ LIBER ✦

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

✍ Scribed by George L. Nemhauser; Laurence A. Wolsey

Publisher: Springer-Verlag
Year: 1990
Tongue: English
Weight: 451 KB
Volume: 46
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01585752

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 disjunctive cutting plane procedure fo

A disjunctive cutting plane procedure for general mixed-integer linear programs

✍ Jonathan H. Owen; Sanjay Mehrotra 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 133 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

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

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 branch-and-cut method for 0-1 mixed co

A branch-and-cut method for 0-1 mixed convex programming

✍ Robert A. Stubbs; Sanjay Mehrotra 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 134 KB