✦ LIBER ✦

Global optimization using the branch‐and‐bound algorithm with a combination of Lipschitz bounds over simplices

✍ Scribed by Paulavičius, Remigijus; Žilinskas, Julius

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel branch and bound for global opt

✍ Paulavičius, Remigijus; Žilinskas, Julius; Grothey, Andreas 📂 Article 📅 2011 🏛 Taylor and Francis Group 🌐 English ⚖ 257 KB

Branching and bounding improvements for

✍ Cartis, Coralia; Fowkes, Jaroslav M.; Gould, Nicholas I. M. 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 499 KB

Index branch-and-bound algorithm for Lip

✍ Yaroslav D. Sergeyev; Domenico Famularo; Paolo Pugliese 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 694 KB

Investigation of selection strategies in

✍ Remigijus Paulavičius; Julius Žilinskas; Andreas Grothey 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 205 KB

An interval branch and bound algorithm f

✍ M.A. Venkataramanan; A.V. Cabot; W.L. Winston 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Developing Interval Global Optimization

✍ Yuri G. Dolgov 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 606 KB