✦ LIBER ✦

A hybrid heuristic for the diameter constrained minimum spanning tree problem

✍ Scribed by Abilio Lucena; Celso C. Ribeiro; Andréa C. Santos

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Greedy heuristics for the diameter-const

✍ C. Requejo; E. Santos 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 385 KB

Improved heuristics for the bounded-diam

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

On the minimum diameter spanning tree pr

✍ Refael Hassin; Arie Tamir 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Modeling hop-constrained and diameter-co

✍ Luis Gouveia; Luidi Simonetti; Eduardo Uchoa 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 452 KB

Approximating the Degree-Bounded Minimum

✍ Jochen Könemann; Asaf Levin; Amitabh Sinha 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 944 KB

An intersecting tree model for odd-diame

✍ Luis Gouveia; Thomas L. Magnanti; Cristina Requejo 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 442 KB