✦ LIBER ✦

The -capacitated spanning tree problem

✍ Scribed by Esther M. Arkin; Nili Guttmann-Beck; Refael Hassin

Book ID: 119227579
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 380 KB
Volume: 9
Category: Article
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2012.08.002

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

The capacitated minimum spanning tree pr

The capacitated minimum spanning tree problem: On improved multistar constraints

✍ Luı́s Gouveia; Maria João Lopes 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 337 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 tabu search algorithm for the Capacita

A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem

✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami

The Capacitated Minimal Spanning Tree Pr

The Capacitated Minimal Spanning Tree Problem: An experiment with a hop‐indexedmodel

✍ L. Gouveia; P. Martins 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 163 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