✦ LIBER ✦

On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search

✍ Scribed by J. Clausen; M. Perregaard

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A study of parallel branch-and-bound alg

✍ J.M Troya; M Ortega 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 363 KB

Combining ordered best-first search with

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

A parallel depth first search branch and

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