Show simple item record

dc.contributor.authorDror, Moshe
dc.contributor.authorGavish, Bezalel
dc.contributor.authorChoquette, Jean
dc.date1988-08
dc.date.accessioned2013-03-07T21:52:32Z
dc.date.available2013-03-07T21:52:32Z
dc.date.issued1988-08
dc.identifier.urihttp://hdl.handle.net/10945/29819
dc.description.abstractA 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)en_US
dc.description.sponsorshipPrepared for: Naval Postgraduate School Monterey, CAen_US
dc.description.urihttp://archive.org/details/directedsteinert00dror
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.subject.lcshGRAPHS.en_US
dc.titleDirected Steiner tree problem on a graph: Models, relaxations, and algorithmsen_US
dc.typeTechnical Reporten_US
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentNA
dc.subject.authorLagrangian relaxation, minimum spanning arborescence problem, networks, Steiner Tree Problemen_US
dc.description.funderO&MN, Direct Fundingen_US
dc.description.recognitionNAen_US
dc.identifier.oclcNA
dc.identifier.npsreportNPS-54-88-010
dc.description.distributionstatementApproved for public release; distribution is unlimited.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record