{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:16:45Z","timestamp":1725491805226},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755197"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75520-3_60","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T03:46:33Z","timestamp":1189741593000},"page":"681-692","source":"Crossref","is-referenced-by-count":5,"title":["A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks"],"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":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60_CR1","unstructured":"Bachhiesl, P.: The OPT- and the SST-problems for real world access network design \u2013 basic definitions and test instances. Working Report NetQuest 01\/2005, Carinthia Tech Institute, Klagenfurt, Austria (2005)"},{"key":"60_CR2","unstructured":"Bachhiesl, P.: The OPT- standard problem, solvers, and results. Working Report NetQuest 02\/2005, Carinthia Tech Institute, Klagenfurt, Austria (2005)"},{"issue":"1","key":"60_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"S.A. Canuto","year":"2001","unstructured":"Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize-collecting steiner tree problem in graphs. Networks\u00a038(1), 50\u201358 (2001)","journal-title":"Networks"},{"key":"60_CR4","unstructured":"Chimani, M., Kandyba, M., Mutzel, P.: A new ILP formulation for a 2-connected prize collecting steiner network problem (tr). Technical Report TR07-1-001, Chair for Algorithm Engineering, Dep. of CS, University Dortmund (2007)"},{"issue":"4","key":"60_CR5","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1137\/0405038","volume":"5","author":"S. Chopra","year":"1992","unstructured":"Chopra, S.: The equivalent subgraph and directed cut polyhedra on series-parallel graphs. SIAM J. Discrete Math.\u00a05(4), 475\u2013490 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"60_CR6","unstructured":"Goemans, M.X.: Analysis of linear programming relaxations for a class of connectivity problems. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA (1990)"},{"key":"60_CR7","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"},{"key":"60_CR8","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":"60_CR9","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":"60_CR10","unstructured":"Ljubic, I.: Exact and Memetic Algorithms for Two Network Design Problems. PhD thesis, Technische Universit\u00e4t Wien (2004)"},{"issue":"2\u20133","key":"60_CR11","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I. Ljubic","year":"2006","unstructured":"Ljubic, 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. Mathematical Programming, Series B\u00a0105(2\u20133), 427\u2013449 (2006)","journal-title":"Mathematical Programming, Series B"},{"issue":"1-3","key":"60_CR12","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":"60_CR13","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"},{"key":"60_CR14","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","volume":"12","author":"C. Nash-Williams","year":"1960","unstructured":"Nash-Williams, C.: On orientations, connectivity and odd-vertex pairings in finite graphs. Canad. J. Math.\u00a012, 555\u2013567 (1960)","journal-title":"Canad. J. Math."},{"key":"60_CR15","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":"60_CR16","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TCT.1969.1083004","volume":"16","author":"K. Steiglitz","year":"1969","unstructured":"Steiglitz, K., Weigner, P., Kleitman, D.J.: The design of minimum-cost survivable networks. IEEE Trans Circuit Theory\u00a016, 455\u2013460 (1969)","journal-title":"IEEE Trans Circuit Theory"},{"key":"60_CR17","series-title":"Lecture Notes in Mathematics","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. Lecture Notes in Mathematics, vol.\u00a01531. Springer, Heidelberg (1992)"},{"key":"60_CR18","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: Operations Research Proceedings 2006, Springer, Heidelberg (2006)"},{"key":"60_CR19","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)"},{"issue":"2","key":"60_CR20","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":"60_CR21","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York, USA (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75520-3_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:23:01Z","timestamp":1619518981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75520-3_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755197"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75520-3_60","relation":{},"subject":[]}}