Valid Inequalities and Facets for the Steinger Problem in a Directed Graph
Name
OR-253-91.pdf
Size
1.11 MB
Format
Adobe PDF
Checksum (MD5)
f6f74f96d0fa45c1f03b8cc3736c1447
Author(s)
Myung, Young-soo
Date Issued
June 1991
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 253-91
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.
Subjects
Steiner problem in a directed graph, valid inequalities, facets.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
