{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T21:10:22Z","timestamp":1743282622248,"version":"3.40.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,6,8]],"date-time":"2012-06-08T00:00:00Z","timestamp":1339113600000},"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":[[2013,12]]},"DOI":"10.1007\/s10107-012-0564-5","type":"journal-article","created":{"date-parts":[[2012,6,7]],"date-time":"2012-06-07T03:22:53Z","timestamp":1339039373000},"page":"133-167","source":"Crossref","is-referenced-by-count":4,"title":["The Steiner connectivity problem"],"prefix":"10.1007","volume":"142","author":[{"given":"Ralf","family":"Bornd\u00f6rfer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marika","family":"Karbstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc E.","family":"Pfetsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,8]]},"reference":[{"issue":"1","key":"564_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T. Achterberg","year":"2009","unstructured":"Achterberg T.: SCIP: solving constraint integer programs. Math. Program Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program Comput."},{"key":"564_CR2","first-page":"311","volume-title":"Annotated Bibliographies in Combinatorial Optimization, chap. 18","author":"A. Balakrishnan","year":"1997","unstructured":"Balakrishnan A., Mangnanti T.L., Mirchandani P.: Network design. In: Dell\u2019Amico, M., Maffioli, F., Martello, S. (eds) Annotated Bibliographies in Combinatorial Optimization, chap. 18, pp. 311\u2013334. Wiley, Chichester (1997)"},{"key":"564_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E., Ceria S., Cornu\u00e9jols G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Prog. 58, 295\u2013324 (1993)","journal-title":"Math. Prog."},{"key":"564_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01582278","volume":"43","author":"E. Balas","year":"1989","unstructured":"Balas E., Ng S.M.: On the set covering polytope: I. All the facets with coefficients in {0,1,2}. Math. Program. 43, 57\u201369 (1989)","journal-title":"Math. Program."},{"issue":"1","key":"564_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1287\/trsc.1060.0161","volume":"41","author":"R. Bornd\u00f6rfer","year":"2007","unstructured":"Bornd\u00f6rfer R., Gr\u00f6tschel M., Pfetsch M.E.: A column-generation approach to line planning in public transport. Transp. Sci. 41(1), 123\u2013132 (2007)","journal-title":"Transp. Sci."},{"key":"564_CR6","unstructured":"Bornd\u00f6rfer, R., Neumann, M.: Linienoptimierung\u2014reif f\u00fcr die Praxis? ZIB-Report 10-20. Zuse Institute Berlin (2010)"},{"key":"564_CR7","unstructured":"Bornd\u00f6rfer, R., Neumann, M.: Models for Line Planning with Transfers. ZIB-Report 10-11, Zuse Institute Berlin (2010)"},{"key":"564_CR8","unstructured":"Bornd\u00f6rfer, R., Neumann, M., Pfetsch, M.E.: The Steiner Connectivity Problem. ZIB-Report 09-07, Zuse Institute Berlin (2009). http:\/\/opus.kobv.de\/zib\/volltexte\/2009\/1166\/"},{"key":"564_CR9","unstructured":"Bussieck, M.: Gams\u2014lop.gms: line optimization. http:\/\/www.gams.com\/modlib\/libhtml\/lop.htm"},{"key":"564_CR10","unstructured":"Bussieck, M.R.: Optimal Lines in Public Rail Transport. PhD thesis, TU Braunschweig (1997)"},{"issue":"1","key":"564_CR11","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0377-2217(95)00367-3","volume":"96","author":"M.R. Bussieck","year":"1997","unstructured":"Bussieck M.R., Kreuzer P., Zimmermann U.T.: Optimal lines for railway systems. Eur. J. Oper. Res. 96(1), 54\u201363 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"564_CR12","doi-asserted-by":"crossref","unstructured":"Bussieck, M.R., Lindner, T., L\u00fcbbecke, M.E.: A fast algorithm for near optimal line plans. Math. Methods Oper. Res. 59(2) (2004)","DOI":"10.1007\/s001860300332"},{"issue":"2","key":"564_CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582573","volume":"64","author":"S. Chopra","year":"1994","unstructured":"Chopra S., Rao M.: The Steiner tree problem I: formulations, compositions and extension of facets. Math. Programm. 64(2), 209\u2013229 (1994)","journal-title":"Math. Programm."},{"issue":"3","key":"564_CR14","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/S0377-2217(97)00271-3","volume":"110","author":"M.T. Claessens","year":"1998","unstructured":"Claessens M.T., van Dijk N.M., Zwaneveld P.J.: Cost optimal allocation of rail passanger lines. Eur. J. Oper. Res. 110(3), 474\u2013489 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"564_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10288-010-0122-z","volume":"8","author":"M. Conforti","year":"2010","unstructured":"Conforti M., Cornu\u00e9jols G., Zambelli G.: Extended formulations in combinatorial optimization. 4OR 8, 1\u201348 (2010)","journal-title":"4OR"},{"key":"564_CR16","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G.: Combinatorial Optimization: Packing and Covering. CBMS-NSF regional conference series in applied mathematics, vol. 74. SIAM, Berlin (2001)","DOI":"10.1137\/1.9780898717105"},{"key":"564_CR17","unstructured":"Dix, A.: Das statische Linienplanungsproblem. Diploma thesis, TU Berlin (2007)"},{"key":"564_CR18","unstructured":"Duin C.W.: Steiner\u2019s Problem in Graphs. PhD thesis, University of Amsterdam (1993)"},{"key":"564_CR19","doi-asserted-by":"crossref","unstructured":"Feige, U.: A threshold of ln n for approximating set-cover. In: Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 314\u2013318 (1996)","DOI":"10.1145\/237814.237977"},{"key":"564_CR20","doi-asserted-by":"crossref","unstructured":"Feldman, J., Ruhl, M.: The directed steiner network problem is tractable for a constant number of terminals. In: IEEE Symposium on Foundations of Computer Science, pp. 299\u2013308 (1999)","DOI":"10.1109\/SFFCS.1999.814601"},{"issue":"2","key":"564_CR21","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-008-0219-8","volume":"120","author":"M. Giandomenico","year":"2009","unstructured":"Giandomenico M., Letchford A.N., Rossi F., Smriglio S.: An application of the Lov\u00e1sz-Schrijver M(K, K) operator to the stable set problem. Math. Programm. 120(2), 381\u2013401 (2009)","journal-title":"Math. Programm."},{"key":"564_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M., Lov\u00e1sz L., Schrijver A.: Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, Berlin (1988)"},{"issue":"4","key":"564_CR23","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":"564_CR24","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. Oper. Res. 40, 309\u2013330 (1992)","journal-title":"Oper. Res."},{"key":"564_CR25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s101070050077","volume":"86","author":"O. G\u00fcnl\u00fck","year":"1999","unstructured":"G\u00fcnl\u00fck O.: A branch-and-cut algorithm for capacitated network design problems. Math. Programm. 86, 17\u201339 (1999)","journal-title":"Math. Programm."},{"key":"564_CR26","unstructured":"IBM. ILOG CPLEX. http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex\/"},{"key":"564_CR27","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, 207\u2013232 (1998)","journal-title":"Networks"},{"key":"564_CR28","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz L., Schrijver A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"564_CR29","unstructured":"Nachtigall, K., Jerosch, K.: Simultaneous network line planning and traffic assignment. In: Fischetti, M., Widmayer, P. (eds.) ATMOS 2008\u20148th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Dagstuhl, Germany. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Germany (2008)"},{"key":"564_CR30","volume-title":"Production Planning by Mixed Integer Programming","author":"Y. Pochet","year":"2006","unstructured":"Pochet Y., Wolsey L.A.: Production Planning by Mixed Integer Programming. Springer, New York (2006)"},{"key":"564_CR31","unstructured":"Polzin, T.: Algorithms for the Steiner Problems in Networks. PhD thesis, University of Saarland, Saarbr\u00fccken (2003)"},{"key":"564_CR32","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0166-218X(00)00318-8","volume":"112","author":"T. Polzin","year":"2001","unstructured":"Polzin T., Daneshmand S.V.: A comparison of Steiner tree relaxations. Discret. Appl. Math. 112, 241\u2013261 (2001)","journal-title":"Discret. Appl. Math."},{"key":"564_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-80291-0","volume-title":"The Steiner Tree Problem","author":"J. Pr\u00f6mel Hans","year":"2002","unstructured":"Pr\u00f6mel Hans J., Steger A.: The Steiner Tree Problem. Vieweg, Braunschweig (2002)"},{"key":"564_CR34","first-page":"335","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"S. Raghavan","year":"1997","unstructured":"Raghavan S., Magnanti T.L.: Network connectivity. In: Mauro, D., Maffioli, F., Martello, S. (eds) Annotated Bibliographies in Combinatorial Optimization, pp. 335\u2013354. Wiley, Chichester (1997)"},{"key":"564_CR35","unstructured":"Sch\u00f6bel, A., Scholl, S.: Line planning with minimal traveling time. In: Kroon Leo, G., M\u00f6hring Rolf, H. (eds.) 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, Dagstuhl, Germany. Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany (2006)"},{"key":"564_CR36","unstructured":"Scholl, S.: Customer-Oriented Line Planning. PhD thesis, Universit\u00e4t G\u00f6ttingen (2005)"},{"key":"564_CR37","unstructured":"SCIP\u2014Solving Constraint Integer Programs. http:\/\/scip.zib.de"},{"key":"564_CR38","unstructured":"Transportation network test problems. http:\/\/www.bgu.ac.il\/~bargera\/tntp\/"},{"key":"564_CR39","doi-asserted-by":"crossref","unstructured":"Torres, L.M., Torres, R., Bornd\u00f6rfer, R., Pfetsch, M.E.: Line planning on paths and tree networks with applications to the Quito Troleb\u00fas System. Int. Trans. Oper. Res. 18(455\u2013472) (2011)","DOI":"10.1111\/j.1475-3995.2010.00802.x"},{"key":"564_CR40","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/978-3-540-68279-0_13","volume-title":"50 Years of Integer Programming 1958\u20132008, chap. 13","author":"F. Vanderbeck","year":"2010","unstructured":"Vanderbeck F., Wolsey L.: Reformulation and decomposition of integer programs. In: J\u00fcnger, M., Liebling, T., Naddef, D., Nemhauser, G.L., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L. (eds) 50 Years of Integer Programming 1958\u20132008, chap. 13, pp. 431\u2013502. Springer, Berlin (2010)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0564-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0564-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0564-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T20:43:47Z","timestamp":1743281027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0564-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,8]]},"references-count":40,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["564"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0564-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2012,6,8]]}}}