{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:42:17Z","timestamp":1775054537107,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540850960","type":"print"},{"value":"9783540850977","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_18","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"190-200","source":"Crossref","is-referenced-by-count":7,"title":["Strong Formulations for 2-Node-Connected Steiner Network Problems"],"prefix":"10.1007","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","reference":[{"key":"18_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D.L. Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"18_CR2","doi-asserted-by":"publisher","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\u00a019, 390\u2013410 (1997)","journal-title":"Algorithmica"},{"key":"18_CR3","unstructured":"Chimani, M., Kandyba, M., Ljubi\u0107, I., Mutzel, P.: Strong formulations for the 2-node-connected steiner network problems (tr). Technical Report TR07-1-008, Chair for Algorithm Engineering, TU Dortmund (November 2007)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Chimani, M., Kandyba, M., Ljubi\u0107, I., Mutzel, P.: Obtaining optimal k-cardinality trees fast. In: Proc. Siam ALENEX 2008 (2008)","DOI":"10.1137\/1.9781611972887.3"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-540-75520-3_60","volume-title":"Algorithms \u2013 ESA 2007","author":"M. Chimani","year":"2007","unstructured":"Chimani, M., Kandyba, M., Mutzel, P.: A new ILP formulation for 2-root-connected prize-collecting Steiner networks. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 681\u2013692. Springer, Heidelberg (2007)"},{"issue":"3","key":"18_CR6","doi-asserted-by":"publisher","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.\u00a05(3), 321\u2013337 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0305-0548(00)00059-9","volume":"29","author":"E. Ghashghai","year":"2002","unstructured":"Ghashghai, E., Rardin, R.L.: Using a hybrid of exact and genetic algorithms to design survivable networks. Computers & OR\u00a029(1), 53\u201366 (2002)","journal-title":"Computers & OR"},{"key":"18_CR8","unstructured":"Goemans, M.X.: Analysis of linear programming relaxations for a class of connectivity problems. PhD thesis. MIT, Cambridge (1990)"},{"key":"18_CR9","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, Proc. Workshop 1989. Discrete Mathematics and Theoretical Computer Science, vol.\u00a05, pp. 121\u2013141. American Mathematical Society (1991)","DOI":"10.1090\/dimacs\/005\/08"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","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 Research\u00a040(2), 309\u2013330 (1992)","journal-title":"Operatios Research"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","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 Journal on Optimization\u00a02(3), 474\u2013504 (1992)","journal-title":"SIAM Journal on Optimization"},{"key":"18_CR12","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, San Fransisco, CA, pp. 760\u2013769 (2000)"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","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\u00a046(1), 1\u201321 (2005)","journal-title":"Networks"},{"key":"18_CR14","unstructured":"Ljubi\u0107, I.: Exact and Memetic Algorithms for Two Network Design Problems. PhD thesis, TU Vienna (2004)"},{"issue":"2\u20133","key":"18_CR15","doi-asserted-by":"publisher","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\u00a0105(2\u20133), 427\u2013449 (2006)","journal-title":"Math. Prog. Ser. B"},{"issue":"1-3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0166-218X(03)00380-9","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 Applied Mathematics\u00a0141(1-3), 277\u2013294 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"18_CR17","doi-asserted-by":"publisher","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\u00a045(2), 61\u201379 (2005)","journal-title":"Networks"},{"issue":"1-3","key":"18_CR18","doi-asserted-by":"publisher","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 Applied Mathematics\u00a0112(1-3), 263\u2013300 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR19","unstructured":"Raghavan, S.: Formulations and Algorithms for the Network Design Problems with Connectivity Requirements. PhD thesis. MIT, Cambridge(1995)"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.2307\/2303897","volume":"46","author":"H.E. Robbins","year":"1939","unstructured":"Robbins, H.E.: A theorem on graphs with an application to a problem of traffic control. American Mathematical Monthly\u00a046, 281\u2013283 (1939)","journal-title":"American Mathematical Monthly"},{"key":"18_CR21","series-title":"LNM","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0088963","volume-title":"Design of Survivable Networks","author":"M. Stoer","year":"1992","unstructured":"Stoer, M.: Design of Survivable Networks. LNM, vol.\u00a01531. Springer, Heidelberg (1992)"},{"key":"18_CR22","unstructured":"Wagner, D.: Generierung und Adaptierung von Testinstanzen f\u00fcr das OPT und SST Problem. Technical Report 03\/2007, Carinthia Tech Institute, Klagenfurt, Austria (2007) (in German)"},{"key":"18_CR23","first-page":"197","volume-title":"Proc. OR 2006","author":"D. Wagner","year":"2006","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 2006, pp. 197\u2013202. Springer, Heidelberg (2006)"},{"issue":"2","key":"18_CR24","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"Winter, P.: Steiner problem in networks: A survey. Networks\u00a017(2), 129\u2013167 (1987)","journal-title":"Networks"},{"key":"18_CR25","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience, Chichester (1998)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:21:53Z","timestamp":1606184513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}