✦ LIBER ✦

A Disjunctive Cutting-Plane-Based Branch-and-Cut Algorithm for 0−1 Mixed-Integer Convex Nonlinear Programs

✍ Scribed by Zhu, Yushan; Kuno, Takahito

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Branch-and-Cut Algorithmic Framework for

✍ Wu, Hao; Wen, Hao; Zhu, Yushan 📂 Article 📅 2009 🏛 American Chemical Society 🌐 English ⚖ 462 KB

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

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

Perspective cuts for a class of convex 0

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

A precise correspondence between lift-an

✍ Egon Balas; Michael Perregaard 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 187 KB

An interior-point Benders based branch-a

✍ Naoum-Sawaya, Joe; Elhedhli, Samir 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 517 KB

Higher-level RLT or disjunctive cuts bas

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