返回Google圖書搜尋

Directed Steiner Tree Problem on a Graph

其他書名	Models, Relaxations, and Algorithms
出版	Defense Technical Information Center, 1988
URL	http://books.google.com.hk/books?id=3YTGwAEACAAJ&hl=&source=gbs_api

註釋A 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 basd on Lagrangian relaxation. As a result, three algorithms are presented and their performance compared on a number of problems originally tested by Beasley (1984, 1987) in the case of undirected graphs. Keywords: Networks, Operations research. (KR).