Back to Search
Start Over
DIRECTED STEINER TREE PROBLEM ON A GRAPH: MODELS, RELAXATIONS AND ALGORITHMS.
- Source :
- INFOR; Aug90, Vol. 28 Issue 3, p266-281, 16p
- Publication Year :
- 1990
-
Abstract
- The Steiner Problem in graphs is the problem of finding a set of edges (arcs) with minimum total weight which connects a given set of nodes in an edge-weighted graph (directed or undirected). This paper develops models for the directed Steiner tree problem on graphs. New and old models are examined in terms of their amenability to solution schemes based on Lagrangean relaxation. As a result, three alogrithms are presented and their performance compared on a number of problems originally tested by Beasley (1984, 1987) in the case of undirected graphs. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 03155986
- Volume :
- 28
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- INFOR
- Publication Type :
- Academic Journal
- Accession number :
- 6283920
- Full Text :
- https://doi.org/10.1080/03155986.1990.11732138