{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:37:51Z","timestamp":1759847871667},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,9]],"date-time":"2010-05-09T00:00:00Z","timestamp":1273363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s10107-010-0375-5","type":"journal-article","created":{"date-parts":[[2010,5,8]],"date-time":"2010-05-08T05:23:49Z","timestamp":1273296229000},"page":"413-439","source":"Crossref","is-referenced-by-count":11,"title":["Orientation-based models for {0,1,2}-survivable network design: theory and practice"],"prefix":"10.1007","volume":"124","author":[{"given":"Markus","family":"Chimani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Kandyba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,9]]},"reference":[{"key":"375_CR1","unstructured":"Bachhiesl, P.: The OPT- and the SST-problems for real world access network design\u2014basic definitions and test instances. Working Report NetQuest 01\/2005, Carinthia Tech Institute, Klagenfurt, Austria (2005)"},{"key":"375_CR2","doi-asserted-by":"crossref","unstructured":"Brandes, U.: Eager st-ordering. In: Proceedings of the 10th European Symposium on Algorithms (ESA 02), LNCS, vol. 2461, pp. 247\u2013256. Springer (2002)","DOI":"10.1007\/3-540-45749-6_25"},{"key":"375_CR3","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"B.V. Cherkassky","year":"1997","unstructured":"Cherkassky B.V., Goldberg A.V.: On implementing push-relabel method for the maximum flow problem. Algorithmica 19, 390\u2013410 (1997)","journal-title":"Algorithmica"},{"key":"375_CR4","doi-asserted-by":"crossref","unstructured":"Chimani, M., Kandyba, M., Ljubi\u0107, I., Mutzel, P.: Strong formulations for 2-node-connected Steiner network problems. In: Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA 2008), LNCS, vol. 5165, pp. 190\u2013200. Springer (2008)","DOI":"10.1007\/978-3-540-85097-7_18"},{"issue":"2","key":"375_CR5","first-page":"5.1","volume":"14","author":"M. Chimani","year":"2009","unstructured":"Chimani M., Kandyba M., Ljubi\u0107 I., Mutzel P.: Obtaining optimal k-cardinality trees fast. ACM J. Exp. Algorithm. 14(2), 5.1\u20135.23 (2009)","journal-title":"ACM J. Exp. Algorithm."},{"key":"375_CR6","doi-asserted-by":"crossref","unstructured":"Chimani, M., Kandyba, M., Mutzel, P.: A new ILP formulation for 2-root-connected prize-collecting Steiner networks. In: Proceedings of the 15th European Symposium on Algorithm (ESA 2007), LNCS, vol. 4698, pp. 681\u2013692. Springer (2007)","DOI":"10.1007\/978-3-540-75520-3_60"},{"issue":"3","key":"375_CR7","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1137\/0405024","volume":"5","author":"S. Chopra","year":"1992","unstructured":"Chopra S.: Polyhedra of the equivalent subgraph problem and some edge connectivity problems. SIAM J. Discrete Math. 5(3), 321\u2013337 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"375_CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230230104","volume":"23","author":"M.X. Goemans","year":"1993","unstructured":"Goemans M.X., Myung Y.: A catalog of Steiner tree formulations. Networks 23, 19\u201328 (1993)","journal-title":"Networks"},{"issue":"4","key":"375_CR9","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1137\/0403043","volume":"3","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel M., Monma C.L.: Integer polyhedra arising from certain network design problems with connectivity constraints. SIAM J. Discret. Math. 3(4), 502\u2013523 (1990)","journal-title":"SIAM J. Discret. Math."},{"key":"375_CR10","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Monma, C.L., Stoer, M.: Polyhedral approaches to network survivability. In: Reliability of computer and communication networks, Proceedings of Workshop 1989, Discrete Mathematics and Theoretical Computer Science, vol. 5, pp. 121\u2013141. American Mathematical Society (1991)","DOI":"10.1090\/dimacs\/005\/08"},{"issue":"2","key":"375_CR11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1287\/opre.40.2.309","volume":"40","author":"M. Gr\u00f6tschel","year":"1992","unstructured":"Gr\u00f6tschel M., Monma C.L., Stoer M.: Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operatios Res. 40(2), 309\u2013330 (1992)","journal-title":"Operatios Res."},{"issue":"3","key":"375_CR12","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/0802024","volume":"2","author":"M. Gr\u00f6tschel","year":"1992","unstructured":"Gr\u00f6tschel M., Monma C.L., Stoer M.: Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM J. Optim. 2(3), 474\u2013504 (1992)","journal-title":"SIAM J. Optim."},{"key":"375_CR13","unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The prize-collecting steiner tree problem: Theory and practice. In: Proceedings of 11th ACM-SIAM Symposium on Distcrete Algorithms, pp. 760\u2013769 (2000)"},{"issue":"1","key":"375_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H. Kerivin","year":"2005","unstructured":"Kerivin H., Mahjoub A.R.: Design of survivable networks: a survey. Networks 46(1), 1\u201321 (2005)","journal-title":"Networks"},{"key":"375_CR15","doi-asserted-by":"crossref","unstructured":"Kerivin, H., Mahjoub, A.R., Nocq, C.: (1,2)-Survivable networks: facets and branch-and-cut. In: M. Gr\u00f6tschel (ed.) The Sharpest Cut, MPS-SIAM Series in optimization, pp. 121\u2013152. SIAM (2004)","DOI":"10.1137\/1.9780898718805.ch9"},{"issue":"3","key":"375_CR16","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T. Koch","year":"1998","unstructured":"Koch T., Martin A.: Solving steiner tree problems in graphs to optimality. Networks 32(3), 207\u2013232 (1998)","journal-title":"Networks"},{"key":"375_CR17","unstructured":"Ljubi\u0107, I.: Exact and memetic algorithms for two network design problems. Ph.D. thesis, TU Vienna (2004)"},{"issue":"2\u20133","key":"375_CR18","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I. Ljubi\u0107","year":"2006","unstructured":"Ljubi\u0107 I., Weiskircher R., Pferschy U., Klau G., Mutzel P., Fischetti M.: An algorithmic framework for the exact solution of the prize-collecting steiner tree problem. Math. Prog. Ser. B 105(2\u20133), 427\u2013449 (2006)","journal-title":"Math. Prog. Ser. B"},{"issue":"1\u20133","key":"375_CR19","first-page":"277","volume":"141","author":"A. Lucena","year":"2003","unstructured":"Lucena A., Resende M.G.C.: Strong lower bounds for the prize-collecting steiner problem in graphs. Discrete Appl. Math. 141(1\u20133), 277\u2013294 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"375_CR20","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/net.20046","volume":"45","author":"T.L. Magnanti","year":"2005","unstructured":"Magnanti T.L., Raghavan S.: Strong formulations for network design problems with connectivity requirements. Networks 45(2), 61\u201379 (2005)","journal-title":"Networks"},{"issue":"2","key":"375_CR21","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01585735","volume":"46","author":"C.L. Monma","year":"1990","unstructured":"Monma C.L., Munson B.S., Pulleyblank W.R.: Minimum-weight two-connected spanning networks. Math. Program. 46(2), 153\u2013171 (1990)","journal-title":"Math. Program."},{"key":"375_CR22","unstructured":"Orlowski, S., Pi\u00f3ro, M., Tomaszewski, A., Wess\u00e4ly, R.: SNDlib 1.0\u2014Survivable Network Design Library. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007) (2007). http:\/\/sndlib.zib.de"},{"issue":"1\u20133","key":"375_CR23","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0166-218X(00)00319-X","volume":"112","author":"T. Polzin","year":"2001","unstructured":"Polzin T., Daneshmand S.V.: Improved algorithms for the Steiner problem in networks. Discrete Appl. Math. 112(1\u20133), 263\u2013300 (2001)","journal-title":"Discrete Appl. Math."},{"key":"375_CR24","unstructured":"Raghavan, S.: Formulations and algorithms for the network design problems with connectivity requirements. Ph.D. thesis, MIT, Cambridge, MA (1995)"},{"key":"375_CR25","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/2303897","volume":"46","author":"H. Robbins","year":"1939","unstructured":"Robbins H.: A theorem on graphs with an application to a problem of traffic control. Am. Math. Mon. 46, 281\u2013283 (1939)","journal-title":"Am. Math. Mon."},{"key":"375_CR26","volume-title":"Design of Survivable Networks, LNCS, vol. 1531","author":"M. Stoer","year":"1992","unstructured":"Stoer M.: Design of Survivable Networks, LNCS, vol. 1531. Springer, Berlin (1992)"},{"key":"375_CR27","unstructured":"TSNDLib: Collection of benchmark instances for Topological {0,1,2}-Survivable Network Design problems (2008). http:\/\/ls11-www.cs.tu-dortmund.de\/TSNDLib\/"},{"key":"375_CR28","unstructured":"TSPLIB. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/"},{"key":"375_CR29","unstructured":"Wagner, D.: Generierung und Adaptierung von Testinstanzen f\u00fcr das OPT und SST Problem. Tech. Rep. 03\/2007, Carinthia Tech Institute, Klagenfurt, Austria (2007). In german"},{"key":"375_CR30","doi-asserted-by":"crossref","unstructured":"Wagner, D., Raidl, G.R., Pferschy, U., Mutzel, P., Bachhiesl, P.: A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks. In: Proc. OR \u201906, pp. 197\u2013202. Springer (2006)","DOI":"10.1007\/978-3-540-69995-8_33"},{"key":"375_CR31","unstructured":"Wagner, D., Raidl, G.R., Pferschy, U., Mutzel, P., Bachhiesl, P.: A directed cut for the design of the last mile in real-world fiber optic networks. In: Proceedings of the International Network Optimization Conference 2007 (2007)"},{"key":"375_CR32","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey L.A.: Integer Programming. Wiley-Interscience, USA (1998)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0375-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0375-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0375-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:08Z","timestamp":1559123408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0375-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,9]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["375"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0375-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,9]]}}}