✦ LIBER ✦

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

✍ Scribed by A. Frangioni; C. Gentile

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 170 KB
Volume: 106
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-005-0594-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 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

Convex envelope results and strong formu

Convex envelope results and strong formulations for a class of mixed-integer programs

✍ Meltem Denizel; S. Selcuk Erenguc; Hanif D. Sherali 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 751 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

Convex approximations for a class of mix

Convex approximations for a class of mixed-integer recourse models

✍ Maarten H. Van der Vlerk 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 374 KB