𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on genetic algorithms for degree-constrained spanning tree problems

✍ Scribed by Zhou, Gengui; Gen, Mitsuo

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
58 KB
Volume
30
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to solve this problem because of its NP-hard complexity. In this paper, we present a new approach to solve this problem by using genetic algorithms and computational results to demonstrate the effectiveness of the proposed approach.

πŸ“œ SIMILAR VOLUMES

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

A polynomial algorithm for thep-centdian
A polynomial algorithm for thep-centdian problem on a tree
✍ Tamir, Arie; PοΏ½rez-Brito, Dionisio; Moreno-PοΏ½rez, JosοΏ½ A. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 108 KB πŸ‘ 1 views

The most common problems studied in network location theory are the p-median and the p-center models. The p-median problem on a network is concerned with the location of p points (medians) on the network, such that the total (weighted) distance of all the nodes to their respective nearest points is