{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:21Z","timestamp":1725488961563},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69995-8_33","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T16:28:21Z","timestamp":1186763301000},"page":"197-202","source":"Crossref","is-referenced-by-count":8,"title":["A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Wagner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Bachhiesl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory, algorithms, and applications. Prentice-Hall, 1993."},{"key":"33_CR2","series-title":"Working Report","volume-title":"The OPT-and the SST-problems for real world access network design \u2014 basic definitions and test instances","author":"P. Bachhiesl","year":"2005","unstructured":"P. Bachhiesl. The OPT-and the SST-problems for real world access network design \u2014 basic definitions and test instances. Working Report Nr. 01\/2005, Department of Telematics and Network Engineering, Carinthia Tech Institute, Austria, 2005."},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"H. A. Eiselt and C.-L. Sandblom. Integer Programming and Network Models. Springer, 2000.","DOI":"10.1007\/978-3-662-04197-0"},{"key":"33_CR4","unstructured":"M. X. Goemans and D. P. Williamson. The Primal-Dual Method for Approximation Algorithms and its Application to Network Design Problems, chapter 4, pages 144\u2013191. PWS Publishing, 1997."},{"issue":"2\u20133","key":"33_CR5","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I. Ljubi\u0107","year":"2006","unstructured":"I. Ljubi\u0107, R. Weiskircher, U. Pferschy, G. W. Klau, P. Mutzel, and M. Fischetti. An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming, 105(2\u20133):427\u2013449, February 2006.","journal-title":"Mathematical Programming"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"M. Pi\u00f3ro and D. Medhi. Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers, 2004.","DOI":"10.1016\/B978-012557189-0\/50011-1"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:06:13Z","timestamp":1605762373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699941"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_33","relation":{},"subject":[]}}