✦ LIBER ✦

A study of parallel branch-and-bound algorithms with best-bound-first search

✍ Scribed by J.M Troya; M Ortega

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the speedup of parall

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

On the best search strategy in parallel

✍ J. Clausen; M. Perregaard 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 111 KB

A parallel depth first search branch and

✍ Bernard Mans; Thierry Mautor; Catherine Roucairol 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 770 KB

A heterogeneous cooperative parallel sea

✍ Yi-Feng Hung; Wei-Chih Chen 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 257 KB

Combining ordered best-first search with

✍ Ebendt, R.; Gunther, W.; Drechsler, R. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 506 KB

A Best-first Branch-and-bound Algorithm

✍ M. Hifi; R. Ouafi 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB