✦ LIBER ✦

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

✍ Scribed by Robert A. Stubbs; Sanjay Mehrotra

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perspective cuts for a class of convex 0

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

Classical cuts for mixed-integer program

✍ Manfred Padberg 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 310 KB

Classical Cuts for Mixed-Integer Program

✍ Manfred Padberg 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 671 KB

Cuts for mixed 0-1 conic programming

✍ M.T. Çezik; G. Iyengar 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 251 KB

bc–opt: a branch-and-cut code for mixed

✍ Cécile Cordier; Hugues Marchand; Richard Laundy; Laurence A. Wolsey 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 131 KB

Decomposition with branch-and-cut approa

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