✦ LIBER ✦

Branch and bound algorithms to determine minimal evolutionary trees

✍ Scribed by M.D. Hendy; David Penny

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embedding Branch and Bound within Evolut

✍ Carlos Cotta; José M. Troya 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 185 KB

A binary branch and bound algorithm to m

✍ Chandra, Charu; Liu, Zhixin; He, Jun; Ruohonen, Toni 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 198 KB

An improved branch and bound algorithm f

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

New branch-and-bound algorithms for k-ca

✍ L. Simonetti; F. Protti; Y. Frota; C.C. de Souza 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 182 KB

A branch-and-bound algorithm to minimize

✍ Chengbin Chu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 945 KB

Finite Exact Branch-and-Bound Algorithms

✍ Marco Locatelli; Nguyen V. Thoai 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 130 KB