✦ LIBER ✦

A global optimization algorithm for solving the minimum multiple ratio spanning tree problem

✍ Scribed by Oleksii Ursulenko, Sergiy Butenko, Oleg A. Prokopyev

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal algorithms for the single and mu

✍ D. B. Johnson and P. Metaxas 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 336 KB

Optimal Algorithms for the Single and Mu

✍ Metaxas, D.B. Johnson, P. 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 192 KB

A GRASP algorithm for the multi-criteria

✍ José Elias Claudio Arroyo; Pedro Sampaio Vieira; Dalessandro Soares Vianna 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 278 KB

A new fast algorithm for solving the min

✍ Wang, Zhaocai; Huang, Dongmei; Meng, Huajun; Tang, Chengpei 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 558 KB

A fast algorithm for the minimum spannin

✍ Francis Suraweera 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 408 KB

A branch and bound algorithm for the cap

✍ Kavindra Malik; Gang Yu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB