✦ LIBER ✦

Generating Convex Polynomial Inequalities for Mixed 0–1 Programs

✍ Scribed by Robert A. Stubbs; Sanjay Mehrotra

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Valid inequalities for mixed 0–1 program

✍ Tony J. Van Roy; Laurence A. Wolsey 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 531 KB

Gap inequalities for non-convex mixed-in

✍ Laura Galli; Konstantinos Kaparis; Adam N. Letchford 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 220 KB

Lifted flow cover inequalities for mixed

✍ Zonghao Gu; George L. Nemhauser; Martin W.P. Savelsbergh 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 238 KB

Perspective cuts for a class of convex 0

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

Lifted inequalities for 0-1 mixed intege

✍ J.-P.P. Richard; I.R. de Farias Jr; G.L. Nemhauser 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 321 KB

A branch-and-cut method for 0-1 mixed co

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