𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A heuristic algorithm for the mini-max spanning forest problem

✍ Scribed by Takeo Yamada; Hideo Takahashi; Seiji Kataoka

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
401 KB
Volume
91
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Faster Algorithm for the Inverse Spann
A Faster Algorithm for the Inverse Spanning Tree Problem
✍ Ravindra K. Ahuja; James B. Orlin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 149 KB

In this paper, we consider the inverse spanning tree problem. Given an undi-0 Ε½ 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0 , the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tre

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