{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T06:11:26Z","timestamp":1751609486398},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7198,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1016\/0166-218x(93)90086-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"109-128","source":"Crossref","is-referenced-by-count":10,"title":["Directed Steiner problems with connectivity constraints"],"prefix":"10.1016","volume":"47","author":[{"given":"Geir","family":"Dahl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90086-4_BIB1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01582278","article-title":"On the set covering polytope: I. All the facets with coefficients in \\s{0, 1, 2\\}","volume":"43","author":"Balas","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90086-4_BIB2","series-title":"Res. Rept.","article-title":"The Steiner tree problem I: formulations, compositions and extensions of facets","author":"Chopra","year":"1988"},{"key":"10.1016\/0166-218X(93)90086-4_BIB3","series-title":"Operational Research '81","first-page":"705","article-title":"Network synthesis with connectivity constraints \u2014 a survey","author":"Christofides","year":"1981"},{"key":"10.1016\/0166-218X(93)90086-4_BIB4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01582277","article-title":"On the 0, 1 facets of the set covering polytope","volume":"43","author":"Cornuejols","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90086-4_BIB5","series-title":"Design of directed survivable networks","author":"Dahl","year":"1989"},{"key":"10.1016\/0166-218X(93)90086-4_BIB6","series-title":"Research Document TF N11\/90","article-title":"The bi-Steiner problem","author":"Dahl","year":"1990"},{"key":"10.1016\/0166-218X(93)90086-4_BIB7","series-title":"Ph.D. Thesis","article-title":"Contributions to the design of survivable directed networks","author":"Dahl","year":"1991"},{"key":"10.1016\/0166-218X(93)90086-4_BIB8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","article-title":"Optimum branchings","volume":"71","author":"Edmonds","year":"1967","journal-title":"J. Res. Nat. Bureau Standards B"},{"key":"10.1016\/0166-218X(93)90086-4_BIB9","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1973"},{"key":"10.1016\/0166-218X(93)90086-4_BIB10","first-page":"63","article-title":"Kernel systems of directed graphs","volume":"41","author":"Frank","year":"1979","journal-title":"Acta Sci. Math."},{"key":"10.1016\/0166-218X(93)90086-4_BIB11","first-page":"136","article-title":"A new approach to the maximum flow problem","author":"Goldberg","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(93)90086-4_BIB12","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/0166-218X(93)90086-4_BIB13","doi-asserted-by":"crossref","DOI":"10.1137\/0403043","article-title":"Integer polyhedra associated with certain network design problems with connectivity constraints","author":"Gr\u00f6tschel","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(93)90086-4_BIB14","series-title":"Rept. 187","article-title":"Facets for polyhedra arising in the design of communication networks with low-connectivity constraints","author":"Gr\u00f6tschel","year":"1989"},{"key":"10.1016\/0166-218X(93)90086-4_BIB15","series-title":"Rept. 188","article-title":"Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints","author":"Gr\u00f6tschel","year":"1989"},{"key":"10.1016\/0166-218X(93)90086-4_BIB16","series-title":"Ph.D. Thesis","article-title":"Extended formulation and polyhedral projection","author":"Liu","year":"1988"},{"key":"10.1016\/0166-218X(93)90086-4_BIB17","series-title":"TF-report 66\/89","article-title":"Mathematical models and algorithms used in the subscriber network planning tool ABONETT","author":"Lorentzen","year":"1989"},{"key":"10.1016\/0166-218X(93)90086-4_BIB18","first-page":"185","article-title":"The Steiner problem in graphs","volume":"31","author":"Maculan","year":"1987"},{"key":"10.1016\/0166-218X(93)90086-4_BIB19","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01585735","article-title":"Minimum weight two-connected spanning networks","volume":"46","author":"Monma","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90086-4_BIB20","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.37.4.531","article-title":"Methods for designing communications networks with certain two-connected survivability constraints","volume":"37","author":"Monma","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)90086-4_BIB21","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/0166-218X(93)90086-4_BIB22","article-title":"Metodo heuristico para o problema de Steiner num grafo direcionado","author":"Pacheco","year":"1986","journal-title":"Proceedings of the III CLAIO, Santiago, Chile"},{"key":"10.1016\/0166-218X(93)90086-4_BIB23","series-title":"Handbooks in Operations Research and Management Science Vol. 1: Optimization","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0927-0507(89)01006-6","article-title":"Polyhedral combinatories","author":"Pulleyblank","year":"1989"},{"key":"10.1016\/0166-218X(93)90086-4_BIB24","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01587087","article-title":"On the facial structure of the set covering polytope","volume":"44","author":"Sassano","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90086-4_BIB25","series-title":"Progress in Combinatorial Optimization","first-page":"315","article-title":"Total dual integrality from directed graphs, crossing families, and sub- and supermodular functions","author":"Schrijver","year":"1984"},{"key":"10.1016\/0166-218X(93)90086-4_BIB26","series-title":"Theory of Integer and Linear Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/0166-218X(93)90086-4_BIB27","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230040204","article-title":"Disjoint paths in networks","volume":"14","author":"Suurballe","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0166-218X(93)90086-4_BIB28","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","article-title":"A quick method for finding shortest pairs of disjoint paths","volume":"14","author":"Suurballe","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0166-218X(93)90086-4_BIB29","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","article-title":"A dual ascent algorithm for Steiner tree problems on a directed graph","volume":"28","author":"Wong","year":"1984","journal-title":"Math. Programming"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93900864?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93900864?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:26:27Z","timestamp":1555122387000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X93900864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["0166218X93900864"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90086-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}