✦ LIBER ✦

Solving diameter-constrained minimum spanning tree problems by constraint programming

✍ Scribed by Thiago F. Noronha; 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

Modeling hop-constrained and diameter-co

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

A hybrid heuristic for the diameter cons

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

Modeling and solving the rooted distance

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

Solving exclusionary side constrained tr

✍ Admi Syarif; Mitsuo Gen 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 405 KB