Abstract
We study a survivable network design problem:the directed network design problem with connectivity constraints (DNCC). Some applications in telecommunications are presented. We discuss two integer linear programming models for DNCC, and relate these. The main body of the paper is a study of DNCC from a polyhedral point of view. We give several classes of nonredundant inequalities for polytopes associated with the problem. A cutting plane algorithm based on the polyhedral results is described and some computational results are given.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
E. Balas and W.R. Pulleyblank, The perfectly matchable subgraph polytope of a bipartite graph, Networks 13(1983)495–516.
Bellcore,Fiber Options: Software for designing survivable fiber optic communications networks, Software Package (1988).
S. Chopra, Polyhedra of the equivalent subgraph problem and some edge connectivity problems, Preprint, Northwestern University, Evanston (1988).
S. Chopra and M.R. Rao, The Steiner tree problem I: Formulations, compositions and extensions of facets, Research Report, Graduate School of Business Administration, New York University (1988).
G. Dahl, Directed Steiner problems with connectivity constraints (1990), Discr. Appl. Math. 47(1993)109–128.
G. Dahl, Contributions to the design of directed survivable networks, Ph.D. Thesis, University of Oslo (1991), ISBN 82-423-0194-8, available from Norwegian Telecom Research.
G. Dantzig, Applications of the simplex method to a transportation problems, in:Activity Analysis of Production and Allocation, ed. T.C. Koopmans (Wiley, New York, 1951).
K.P. Eswaran and R.E. Tarjan, Augmentation problems, SIAM J. Comp. 5(1976)653–665.
M. Grötschel, L. Lovasz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, 1988).
M. Grötschel and C.L. Monma, Integer polyhedra arising from certain network design problems with connectivity constraints, SIAM J. Discr. Math. 3(1990)502–523.
M. Grötschel, C.L. Monma and M. Stoer, Facets for polyhedra arising in the design of communication networks with low-connectivity constraints, Report No. 187, UniversitÄt Augsburg (1989).
M. Grötschel, C.L. Monma and M. Stoer, Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints, Report No. 188, UniversitÄt Augsburg (1989).
M. Grötschel, C.L. Monma and M. Stoer, Polyhedral approaches to network survivability, Report No. 189, UniversitÄt Augsburg (1989).
W.G. Liu, Extended formulation and polyhedral projection, Ph.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo (1988).
C.L. Monma, B. Munson and W.R. Pulleyblank, Minimum weight two-connected spanning networks, Math. Progr. 46(1990)153–171.
C.L. Monma and D.F. Shallcross, Methods for designing communication networks with certain two-connected survivability constraints, Oper. Res. 37(1989)531–541.
W.R. Pulleyblank, Polyhedral combinatorics, in:Handbooks in Operations Research and Management Science, Vol. 1, Optimization, eds. G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd (North-Holland, Amsterdam, 1989).
A. Sassano, On the facial structure of the set covering polytope, Math. Progr. 44(1989)181–203.
A. Schrijver,Theory of Integer and Linear Programming (Wiley, 1986).
T. Soneoka, H. Nakada and M. Imase, Design of ad-connected digraph with a minimum number of edges and a quasiminimal diameter, Discr. Appl. Math. 27(1990)255–265.
K. Steiglitz, P. Wiener and D.J. Kleitman, The design of minimum-cost survivable networks, IEEE Trans. Circuit Theory 16(1969)455–460.
M. Stoer, Design of survivable networks, Ph.D. Thesis, University of Augsburg (1991).
J.W. Suurballe, Disjoint paths in networks, Networks 14(1974)125–145.
P. Winter, Generalized Steiner problems in series-parallel networks, BIT 25(1985)485–496.
P. Winter, Generalized Steiner problems in outerplanar networks, J. Algorithms 7(1986)549–566.
R.T. Wong, A dual ascent algorithm for Steiner tree problems on a directed graph, Math. Progr. 28(1984)271–287.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dahl, G. The design of survivable directed networks. Telecommunication Systems 2, 349–377 (1993). https://doi.org/10.1007/BF02109865
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02109865