Abstract
The Steiner arborescence (or Steiner directed tree) problem concerns the connection of a set of target vertices of a digraph to a given root vertex. This problem is known to be NP-hard. In the present paper we study the facial structure of two polyhedra associated with the problem. Several classes of valid inequalities are considered, and a new class with arbitrarily large coefficients is introduced. All these inequalities are shown to define distinct facets of both the Steiner polyhedra considered. This is achieved by exploiting two lifting theorems which also allow generalization of the new inequalities. Composition theorems are finally given and used to derive large families of new facet-inducing inequalities with exponentially large coefficients.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas and M. Fischetti, “The fixed-outdegree 1-arborescence polytope,” Management Science Research Report No. MSRR-551, GSIA, Carnegie-Mellon University (Pittsburgh, PA, 1988).
M.O. Ball, W. Liu and W.R. Pulleyblank, “Two terminal Steiner tree polyhedra,” Report No. 87466-OR, Institut Für Ökonometrie und Operations Research, University of Bonn (Bonn, 1987).
S. Chopra and M.R. Rao, “The Steiner tree problem I: formulations, compositions and extension of facets,” Technical Report No. 88-82, Graduate School of Business Administration, New York University (New York, 1988a).
S. Chopra and M.R. Rao, “The Steiner tree problem II: properties and classes of facets,” Technical Report No. 88-83, Graduate School of Business Administration, New York University (New York, 1988b).
J. Edmonds, “Optimum branchings,”Journal of Research of the National Bureau of Standards 71B (1967) 233–240.
M. Fischetti, “Facets of the asymmetric traveling salesman polytype,”Mathematics of Operations Research 16 (1991) 42–56.
H.N. Gabow, Z. Galil, T. Spencer and R.E. Tarjan, “Efficient algorithms for finding minimum spanning trees in undirected and directed graphs,”Combinatorica 6 (1986) 109–122.
M.R. Garey and D.S. Johnson,Computers and Intractability: a Guide to the Theory of the NP-completeness (Freeman, San Francisco, CA, 1979).
R. Giles, “Submodular functions, graphs, and integer polyhedra,” Ph.D. Thesis, University of Waterloo (Waterloo, Ont., 1975).
M. Grötschel,Polyedrische Charakterisierungen Kombinatorischer Optimierungsprobleme (Hain, Meisenheim am Glan, 1977).
M. Grötschel and M.W. Padberg, “Polyhedral theory,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem (Wiley, New York, 1985).
W. Liu, “Extended formulations and polyhedral projection,” Ph.D. Thesis, University of Waterloo, (Waterloo, Ont., 1988).
W. Liu, “A lower bound for the Steiner tree problem in directed graphs,”Networks 20 (1990) 765–778.
N. Maculan, “The Steiner problem in graphs,”Annals of Discrete Mathematics 31 (1987) 185–212.
G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988).
W.R. Pulleyblank, “Polyhedral combinatorics,” in: A. Bachem, M. Grötschel and B. Korte, eds.,Mathematical Programming: The State of the Art (Bonn 1982) (Springer, Berlin, 1983).
A. Segev, “The node-weighted Steiner tree problem,”Networks 17 (1987) 1–17.
P. Winter, “Steiner problem in networks: a survey,”Networks 17 (1987) 129–167.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fischetti, M. Facets of two Steiner arborescence polyhedra. Mathematical Programming 51, 401–419 (1991). https://doi.org/10.1007/BF01586946
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01586946