{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:28:50Z","timestamp":1759336130150},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf02109865","type":"journal-article","created":{"date-parts":[[2005,9,13]],"date-time":"2005-09-13T09:51:41Z","timestamp":1126605101000},"page":"349-377","source":"Crossref","is-referenced-by-count":8,"title":["The design of survivable directed networks"],"prefix":"10.1007","volume":"2","author":[{"given":"Geir","family":"Dahl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02109865_CR1","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/net.3230130405","volume":"13","author":"E. Balas","year":"1983","unstructured":"E. Balas and W.R. Pulleyblank, The perfectly matchable subgraph polytope of a bipartite graph, Networks 13(1983)495\u2013516.","journal-title":"Networks"},{"key":"BF02109865_CR2","unstructured":"Bellcore,Fiber Options: Software for designing survivable fiber optic communications networks, Software Package (1988)."},{"key":"BF02109865_CR3","volume-title":"Polyhedra of the equivalent subgraph problem and some edge connectivity problems","author":"S. Chopra","year":"1988","unstructured":"S. Chopra, Polyhedra of the equivalent subgraph problem and some edge connectivity problems, Preprint, Northwestern University, Evanston (1988)."},{"key":"BF02109865_CR4","unstructured":"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)."},{"key":"BF02109865_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(93)90086-4","volume":"47","author":"G. Dahl","year":"1993","unstructured":"G. Dahl, Directed Steiner problems with connectivity constraints (1990), Discr. Appl. Math. 47(1993)109\u2013128.","journal-title":"Discr. Appl. Math."},{"key":"BF02109865_CR6","unstructured":"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."},{"key":"BF02109865_CR7","volume-title":"Activity Analysis of Production and Allocation","author":"G. Dantzig","year":"1951","unstructured":"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)."},{"key":"BF02109865_CR8","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"K.P. Eswaran and R.E. Tarjan, Augmentation problems, SIAM J. Comp. 5(1976)653\u2013665.","journal-title":"SIAM J. Comp."},{"key":"BF02109865_CR9","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lovasz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, 1988).","DOI":"10.1007\/978-3-642-97881-4"},{"key":"BF02109865_CR10","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1137\/0403043","volume":"3","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"M. Gr\u00f6tschel and C.L. Monma, Integer polyhedra arising from certain network design problems with connectivity constraints, SIAM J. Discr. Math. 3(1990)502\u2013523.","journal-title":"SIAM J. Discr. Math."},{"key":"BF02109865_CR11","unstructured":"M. Gr\u00f6tschel, C.L. Monma and M. Stoer, Facets for polyhedra arising in the design of communication networks with low-connectivity constraints, Report No. 187, Universit\u00c4t Augsburg (1989)."},{"key":"BF02109865_CR12","unstructured":"M. Gr\u00f6tschel, 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\u00c4t Augsburg (1989)."},{"key":"BF02109865_CR13","unstructured":"M. Gr\u00f6tschel, C.L. Monma and M. Stoer, Polyhedral approaches to network survivability, Report No. 189, Universit\u00c4t Augsburg (1989)."},{"key":"BF02109865_CR14","unstructured":"W.G. Liu, Extended formulation and polyhedral projection, Ph.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo (1988)."},{"key":"BF02109865_CR15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01585735","volume":"46","author":"C.L. Monma","year":"1990","unstructured":"C.L. Monma, B. Munson and W.R. Pulleyblank, Minimum weight two-connected spanning networks, Math. Progr. 46(1990)153\u2013171.","journal-title":"Math. Progr."},{"key":"BF02109865_CR16","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.37.4.531","volume":"37","author":"C.L. Monma","year":"1989","unstructured":"C.L. Monma and D.F. Shallcross, Methods for designing communication networks with certain two-connected survivability constraints, Oper. Res. 37(1989)531\u2013541.","journal-title":"Oper. Res."},{"key":"BF02109865_CR17","volume-title":"Handbooks in Operations Research and Management Science, Vol. 1, Optimization","author":"W.R. Pulleyblank","year":"1989","unstructured":"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)."},{"key":"BF02109865_CR18","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01587087","volume":"44","author":"A. Sassano","year":"1989","unstructured":"A. Sassano, On the facial structure of the set covering polytope, Math. Progr. 44(1989)181\u2013203.","journal-title":"Math. Progr."},{"key":"BF02109865_CR19","unstructured":"A. Schrijver,Theory of Integer and Linear Programming (Wiley, 1986)."},{"key":"BF02109865_CR20","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90069-O","volume":"27","author":"T. Soneoka","year":"1990","unstructured":"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\u2013265.","journal-title":"Discr. Appl. Math."},{"key":"BF02109865_CR21","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TCT.1969.1083004","volume":"16","author":"K. Steiglitz","year":"1969","unstructured":"K. Steiglitz, P. Wiener and D.J. Kleitman, The design of minimum-cost survivable networks, IEEE Trans. Circuit Theory 16(1969)455\u2013460.","journal-title":"IEEE Trans. Circuit Theory"},{"key":"BF02109865_CR22","doi-asserted-by":"crossref","unstructured":"M. Stoer, Design of survivable networks, Ph.D. Thesis, University of Augsburg (1991).","DOI":"10.1007\/BFb0088963"},{"key":"BF02109865_CR23","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"14","author":"J.W. Suurballe","year":"1974","unstructured":"J.W. Suurballe, Disjoint paths in networks, Networks 14(1974)125\u2013145.","journal-title":"Networks"},{"key":"BF02109865_CR24","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF01935369","volume":"25","author":"P. Winter","year":"1985","unstructured":"P. Winter, Generalized Steiner problems in series-parallel networks, BIT 25(1985)485\u2013496.","journal-title":"BIT"},{"key":"BF02109865_CR25","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/0196-6774(86)90018-0","volume":"7","author":"P. Winter","year":"1986","unstructured":"P. Winter, Generalized Steiner problems in outerplanar networks, J. Algorithms 7(1986)549\u2013566.","journal-title":"J. Algorithms"},{"key":"BF02109865_CR26","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R.T. Wong","year":"1984","unstructured":"R.T. Wong, A dual ascent algorithm for Steiner tree problems on a directed graph, Math. Progr. 28(1984)271\u2013287.","journal-title":"Math. Progr."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02109865.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02109865\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02109865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T11:41:55Z","timestamp":1586432515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02109865"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02109865"],"URL":"https:\/\/doi.org\/10.1007\/bf02109865","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}