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.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/5223 |
| Date | 06 1900 |
| Creators | Myung, Young-soo |
| Publisher | Massachusetts Institute of Technology, Operations Research Center |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Type | Working Paper |
| Format | 1159153 bytes, application/pdf |
| Relation | Operations Research Center Working Paper;OR 253-91 |
Page generated in 0.0019 seconds