✦ LIBER ✦

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

✍ Scribed by Ravindra K. Ahuja; James B. Orlin; Dushyant Sharma

Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 319 KB
Volume: 91
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070100234

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

Branch-and-cut and hybrid local search f

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem

✍ Eduardo Uchoa; Túlio A. M. Toffolo; Mauricio C. de Souza; Alexandre X. Martins; 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 139 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

A GRASP algorithm for the multi-criteria

A GRASP algorithm for the multi-criteria minimum spanning tree problem

✍ José Elias Claudio Arroyo; Pedro Sampaio Vieira; Dalessandro Soares Vianna 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 278 KB

Edge exchanges in the degree-constrained

Edge exchanges in the degree-constrained minimum spanning tree problem

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