✦ LIBER ✦

Branch-and-Cut Algorithmic Framework for 0−1 Mixed-Integer Convex Nonlinear Programs

✍ Scribed by Wu, Hao; Wen, Hao; Zhu, Yushan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 branch-and-bound algorithm for 0–1 par

✍ Yoshiaki Ohtake; Naonori Nishida 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 332 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

An improved branch and bound algorithm f

✍ Brian Borchers; John E. Mitchell 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 870 KB