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.
Massachusetts Institute of Technology, Operations Research Center
Operations Research Center Working Paper;OR 253-91
Steiner problem in a directed graph, valid inequalities, facets.