✦ LIBER ✦

On the Expected Performance of Branch-And-Bound Algorithms

✍ Scribed by J. K. Lenstra and A. H. G. Rinnooy Kan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Expected Performance of Path Comp

✍ Yao, Andrew C. 📂 Article 📅 1985 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 667 KB

A branch and bound algorithm for minimiz

✍ Yosi Ben-dov 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 390 KB

On the Hybridization of Memetic Algorith

✍ Gallardo, J.E.; Cotta, C.; Fernandez, A.J. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 205 KB

Adaptive parallel interval branch and bo

✍ J. F. Sanjuan-Estrada; L. G. Casado; I. García 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 569 KB

EFFICIENT MODULAR IMPLEMENTATION OF BRAN

✍ Roger V. Johnson 📂 Article 📅 1988 🏛 Decision Sciences Institute, Georgia State Univers 🌐 English ⚖ 1019 KB

An upper bound for the speedup of parall

✍ Michael J. Quinn; Narsingh Deo 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 586 KB