✦ LIBER ✦

Solving the minimum labelling spanning tree problem using hybrid local search

✍ Scribed by S. Consoli; J.A. Moreno Pérez

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the Quadratic Minimum Spanning T

✍ Roberto Cordone; Gianluca Passeri 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 881 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

Randomized local search, evolutionary al

✍ Frank Neumann; Ingo Wegener 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 285 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

Improved Heuristics for the Minimum Labe

✍ Yupei Xiong; Golden, B.; Wasil, E. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 313 KB

Variable neighbourhood search for the mi

✍ Sergio Consoli; Kenneth Darby-Dowman; Nenad Mladenović; José Andrés Moreno-Pérez 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 599 KB