| dc.contributor.author | Myung, Young-soo | en_US |
| dc.date.accessioned | 2004-05-28T19:28:52Z | |
| dc.date.available | 2004-05-28T19:28:52Z | |
| dc.date.issued | 1991-06 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5223 | |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 1159153 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Massachusetts Institute of Technology, Operations Research Center | en_US |
| dc.relation.ispartofseries | Operations Research Center Working Paper;OR 253-91 | en_US |
| dc.subject | Steiner problem in a directed graph, valid inequalities, facets. | en_US |
| dc.title | Valid Inequalities and Facets for the Steinger Problem in a Directed Graph | en_US |
| dc.type | Working Paper | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Operations Research Center | |
