✦ LIBER ✦

Randomized local search, evolutionary algorithms, and the minimum spanning tree problem

✍ Scribed by Frank Neumann; Ingo Wegener

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the minimum labelling spanning t

✍ S. Consoli; J.A. Moreno Pérez 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Local search for the minimum label spann

✍ Tobias Brüggemann; Jérôme Monnot; Gerhard J. Woeginger 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 220 KB

The quadratic minimum spanning tree prob

✍ Arjang Assad; Weixuan Xu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 893 KB

Branch-and-cut and hybrid local search f

✍ Eduardo Uchoa; Túlio A. M. Toffolo; Mauricio C. de Souza; Alexandre X. Martins; 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

On symbolic OBDD-based algorithms for th

✍ Beate Bollig 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 310 KB

A new evolutionary approach to the degre

✍ Knowles, J.; Corne, D. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 202 KB