✦ LIBER ✦

The subdivision-constrained minimum spanning tree problem

✍ Scribed by Jianping Li; Weidong Li; Tongquan Zhang; Zhongxu Zhang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree-constrained minimum spanning tree

✍ Subhash C. Narula; Cesar A. Ho 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 868 KB

Greedy heuristics for the diameter-const

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

Edge exchanges in the degree-constrained

✍ Martin Savelsbergh; Ton Volgenant 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 725 KB

A hybrid heuristic for the diameter cons

✍ Abilio Lucena; Celso C. Ribeiro; Andréa C. Santos 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 363 KB

A Lagrangean approach to the degree-cons

✍ A. Volgenant 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 451 KB

Modeling and solving the rooted distance

✍ Luis Gouveia; Ana Paias; Dushyant Sharma 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 184 KB