✦ LIBER ✦

Heuristics for the multi-level capacitated minimum spanning tree problem

✍ Scribed by Christos A. Pappas, Angelos-Christos G. Anadiotis…

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multi-exchange neighborhood structures f

✍ Ravindra K. Ahuja; James B. Orlin; Dushyant Sharma 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 319 KB

RAMP for the capacitated minimum spannin

✍ Cesar Rego; Frank Mathew; Fred Glover 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 419 KB

Heuristics for Minimum Spanning K-tree P

✍ Shangin, Roman E.; Pardalos, Panos M. 📂 Article 📅 2014 🏛 Elsevier 🌐 English ⚖ 288 KB

Least cost heuristic for the delay-const

✍ Yong-Jin Lee; M. Atiquzzaman 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 195 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