✦ LIBER ✦

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

✍ Scribed by José Elias Claudio Arroyo; Pedro Sampaio Vieira; Dalessandro Soares Vianna

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 278 KB
Volume: 159
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-007-0263-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Genetic algorithm approach on multi-crit

Genetic algorithm approach on multi-criteria minimum spanning tree problem

✍ Gengui Zhou; Mitsuo Gen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Offline Algorithms for Dynamic Minimum S

Offline Algorithms for Dynamic Minimum Spanning Tree Problems

✍ D. Eppstein 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 651 KB

We describe an efficient algorithm for maintaining a minimum spanning tree (MST) in a graph subject to a sequence of edge weight modifications. The sequence of minimum spanning trees is computed offline, after the sequence of modifications is known. The algorithm takes time \(O(k \log n)\) for a seq

A fast algorithm for the minimum spannin

A fast algorithm for the minimum spanning tree

✍ Francis Suraweera 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 408 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

An O(log m) parallel algorithm for the m

An O(log m) parallel algorithm for the minimum spanning tree problem

✍ Francis Suraweera; Prabir Bhattacharya 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 481 KB