✦ LIBER ✦

A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem

✍ Scribed by R. Patterson; H. Pirkul; E. Rolland

Book ID: 110277454
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 108 KB
Volume: 5
Category: Article
ISSN: 1381-1231
DOI: 10.1023/a:1009629727566

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

RAMP for the capacitated minimum spannin

RAMP for the capacitated minimum spanning tree problem

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

A branch and bound algorithm for the cap

A branch and bound algorithm for the capacitated minimum spanning tree problem

✍ Kavindra Malik; Gang Yu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

Multi-exchange neighborhood structures f

Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem

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

A hierarchy of hop-indexed models for th

A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem

✍ Gouveia, Luis; Martins, Pedro 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 2 views

The Capacitated Minimum Spanning Tree Problem (CMSTP) is to find a minimum spanning tree subject to an additional constraint stating that the number of nodes in each subtree pending from a given root node is not greater than a given number Q. Gouveia and Martins (1996) proposed a hop-indexed flow mo

Least cost heuristic for the delay-const

Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem

✍ Yong-Jin Lee; M. Atiquzzaman 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Savings based ant colony optimization fo

Savings based ant colony optimization for the capacitated minimum spanning tree problem

✍ Marc Reimann; Marco Laumanns 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 389 KB