DSpace Repository

Valid Inequalities and Facets for the Steinger Problem in a Directed Graph

Show simple item record

dc.creator Myung, Young-soo
dc.date 2004-05-28T19:28:52Z
dc.date 2004-05-28T19:28:52Z
dc.date 1991-06
dc.date.accessioned 2013-10-09T02:38:29Z
dc.date.available 2013-10-09T02:38:29Z
dc.date.issued 2013-10-09
dc.identifier http://hdl.handle.net/1721.1/5223
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description In this paper, we describe the facial structure of the steiner problem in a directed graph by formulating it as a set covering problem. We first characterize trivial facets and derive a necessary condition for nontrivial facets. We also introduce a class of valid inequalities with 0-1 coefficients and show when such inequalities define facets.
dc.format 1159153 bytes
dc.format application/pdf
dc.language en_US
dc.publisher Massachusetts Institute of Technology, Operations Research Center
dc.relation Operations Research Center Working Paper;OR 253-91
dc.subject Steiner problem in a directed graph, valid inequalities, facets.
dc.title Valid Inequalities and Facets for the Steinger Problem in a Directed Graph
dc.type Working Paper


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account