✦ LIBER ✦

A Combined D.C. Optimization—Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems

✍ Scribed by Le Thi Hoai An; Pham Dinh Tao; Le Dung Muu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Branch and Bound Method via d.c. Optim

✍ Le Thi Hoai An; Pham Dinh Tao 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 189 KB

A branch and bound algorithm for globall

✍ Hongwei Jiao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 574 KB

A Simplicial Branch-and-Bound Method for

✍ Ulrich Raber 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 107 KB

A finite branch-and-bound algorithm for

✍ Samuel Burer; Dieter Vandenbussche 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 347 KB

A simplicial branch-and-bound algorithm

✍ Jeff Linderoth 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 390 KB

A branch and bound algorithm for solving

✍ A. Victor Cabot; S. Selcuk Erenguc 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 501 KB