✦ LIBER ✦

Local search for the minimum label spanning tree problem with bounded color classes

✍ Scribed by Tobias Brüggemann; Jérôme Monnot; Gerhard J. Woeginger

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

Improved Heuristics for the Minimum Labe

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

Randomized local search, evolutionary al

✍ Frank Neumann; Ingo Wegener 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Improved heuristics for the bounded-diam

✍ Alok Singh; Ashok K. Gupta 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 423 KB

A mixed integer linear formulation for t

✍ M.Eugénia Captivo; João C.N. Clímaco; Marta M.B. Pascoal 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 114 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