Return to search

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

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.

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/5223
Date06 1900
CreatorsMyung, Young-soo
PublisherMassachusetts Institute of Technology, Operations Research Center
Source SetsM.I.T. Theses and Dissertation
Languageen_US
Detected LanguageEnglish
TypeWorking Paper
Format1159153 bytes, application/pdf
RelationOperations Research Center Working Paper;OR 253-91

Page generated in 0.0019 seconds