{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:28:33Z","timestamp":1761895713441,"version":"build-2065373602"},"reference-count":26,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100008610","name":"Eesti Teaduste Akadeemia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008610","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s13675-013-0014-z","type":"journal-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T09:11:49Z","timestamp":1378199509000},"page":"221-252","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"title":["Lagrangian decompositions for the two-level FTTx network design problem"],"prefix":"10.1016","volume":"1","author":[{"given":"Andreas","family":"Bley","sequence":"first","affiliation":[]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[]},{"given":"Olaf","family":"Maurer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"7","key":"10.1007\/s13675-013-0014-z_CR1","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/mnsc.40.7.846","article-title":"Modeling and heuristic worst-case performance analysis of the two-level network design problem","volume":"40","author":"Balakrishnan","year":"1994","journal-title":"Manag Sci"},{"key":"10.1007\/s13675-013-0014-z_CR2","doi-asserted-by":"crossref","unstructured":"Bonnans JF, Gilbert JC, Lemar\u00e9chal C, Sagastiza\u00e1bal CA (2003) Numerical optimization. Springer, New York","DOI":"10.1007\/978-3-662-05078-1"},{"issue":"3","key":"10.1007\/s13675-013-0014-z_CR3","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/j.ejor.2012.05.024","article-title":"Optimizing splitter and fiber location in a multilevel optical FTTH network","volume":"222","author":"Chardy","year":"2012","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-013-0014-z_CR4","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/PL00009180","article-title":"On implementing push-relabel method for the maximum flow problem","volume":"19","author":"Cherkassky","year":"1997","journal-title":"Algorithmica"},{"issue":"8","key":"10.1007\/s13675-013-0014-z_CR5","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1016\/j.jcss.2010.02.001","article-title":"Connected facility location via random facility sampling and core detouring","volume":"76","author":"Eisenbrand","year":"2010","journal-title":"J Comput Syst Sci"},{"key":"10.1007\/s13675-013-0014-z_CR6","unstructured":"FTTx-Plan. FTTx-plan: Kostenoptimierte Planung von FTTx-Netzen. http:\/\/www.fttx-plan.de\/"},{"key":"10.1007\/s13675-013-0014-z_CR7","unstructured":"A. Goldberg (2012) Andrew Goldberg\u2019s network optimization library. http:\/\/www.avglab.com\/andrew\/soft.html"},{"issue":"2","key":"10.1007\/s13675-013-0014-z_CR8","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.cor.2010.07.002","article-title":"MIP models for connected facility location: a theoretical and computational study","volume":"38","author":"Gollowitzer","year":"2011","journal-title":"Comput Oper Res"},{"issue":"2","key":"10.1007\/s13675-013-0014-z_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.ejor.2012.09.040","article-title":"Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities","volume":"225","author":"Gollowitzer","year":"2013","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-013-0014-z_CR10","unstructured":"Gr\u00f6tschel M, Raack C, Werner A (2013) Towards optimizing the deployment of optical access networks. EURO J. Comput. Optim"},{"key":"10.1007\/s13675-013-0014-z_CR11","unstructured":"Gualandi S, Malucelli F, Sozzi D.L. (2010a) On the design of the fiber to the home networks. In: Faigle U, Schrader R, Herrmann D, (eds) 9th CTW Workshop, Cologne, Germany, 2010. Extended Abstracts, pp 65\u201368"},{"key":"10.1007\/s13675-013-0014-z_CR12","doi-asserted-by":"crossref","unstructured":"Gualandi S, Malucelli F, Sozzi DL (2010b) On the design of the next generation access networks. In: Lodi A, Milano M, Toth P (eds) CPAIOR 2010, Bologna, Italy, June 2010. Lecture notes in Computer Science, vol 6140. Springer, Berlin, pp 162\u2013175","DOI":"10.1007\/978-3-642-13520-0_20"},{"key":"10.1007\/s13675-013-0014-z_CR13","unstructured":"Helmberg C (2009) Network models with convex cost structure like bundle methods. In: Barnhart C, Clausen U, Lauther U, M\u00f6hring RH (eds) Models and algorithms for optimization in logistics, number 09261 in Dagstuhl seminar proceedings, Dagstuhl, Germany. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany"},{"key":"10.1007\/s13675-013-0014-z_CR14","unstructured":"Helmberg C (2012) The conicbundle library for convex optimization. http:\/\/www-user.tu-chemnitz.de\/helmberg\/ConicBundle\/"},{"issue":"2","key":"10.1007\/s13675-013-0014-z_CR15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s101070100270","article-title":"A spectral bundle method with bounds","volume":"93","author":"Helmberg","year":"2002","journal-title":"Math Program"},{"key":"10.1007\/s13675-013-0014-z_CR16","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty JB, Lemar\u00e9chal C (1993) Convex analysis and minimization algorithms. In: Volume 306 of Grundlehren der mathematischen Wissenschaften. Springer, Berlin","DOI":"10.1007\/978-3-662-02796-7"},{"issue":"2","key":"10.1007\/s13675-013-0014-z_CR17","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.ejor.2010.10.003","article-title":"A splitter locationallocation problem in designing fiber optic access networks","volume":"210","author":"Kim","year":"2011","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-013-0014-z_CR18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10852-011-9153-5","article-title":"Branch-and-cut-and-price for capacitated connected facility location","volume":"10","author":"Leitner","year":"2011","journal-title":"J Math Model Algorithms"},{"key":"10.1007\/s13675-013-0014-z_CR19","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","article-title":"An algorithmic framework for the eExact solution of the prize-collecting steiner tree problem","volume":"105","author":"Ljubi\u0107","year":"2006","journal-title":"Math Program"},{"issue":"1","key":"10.1007\/s13675-013-0014-z_CR20","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/net.20481","article-title":"Exact approaches to the single-source network loading problem","volume":"59","author":"Ljubi\u0107","year":"2012","journal-title":"Networks"},{"key":"10.1007\/s13675-013-0014-z_CR21","unstructured":"Martens M, Patzak E, Richter A, Wess\u00e4ly R (2009) Werkzeuge zur Planung und Optimierung von FTTx-Netzen. In: 16. ITG-Fachtagung Kommunikationskabelnetze, K\u00f6ln, Germany, vol 218, pp 37\u201341. VDE, Berlin"},{"key":"10.1007\/s13675-013-0014-z_CR22","unstructured":"Martens M, Orlowski S, Werner A, Wess\u00e4ly R, Bentz W (2010) FTTx-PLAN: optimierter aufbau von FTTx-Netzen. In: Breitbandversorgung in Deutschland, vol 220 of ITG-Fachbericht. VDE, Berlin"},{"issue":"3","key":"10.1007\/s13675-013-0014-z_CR23","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","article-title":"A faster approximation algorithm for the Steiner problem in graphs","volume":"27","author":"Mehlhorn","year":"1988","journal-title":"Inform Process Lett"},{"key":"10.1007\/s13675-013-0014-z_CR24","unstructured":"Orlowski S, Werner A, Wess\u00e4ly R, Eckel K, Seibel J, Patzak E, Louchet H, Bentz W (2011) Sch\u00e4tze heben bei der Planung von FTTx-Netzen: optimierte Nutzung von existierenden Leerrohren - eine Praxisstudie. In: Breitbandversorgung in Deutschland, vol 227 of ITG-Fachbericht. VDE, Berlin"},{"key":"10.1007\/s13675-013-0014-z_CR25","unstructured":"Putz P (2012) Fiber to the home, cost optimal design of last-mile broadband telecommunication networks. PhD thesis, University of Vienna"},{"key":"10.1007\/s13675-013-0014-z_CR26","unstructured":"Salman FS (2000) Selected problems in network design: exact and approximate solution methods. PhD thesis, Carnegie Mellon University, Pittsburgh"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-013-0014-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-013-0014-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000204?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000204?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-013-0014-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:45:18Z","timestamp":1761882318000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":26,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["S2192440621000204"],"URL":"https:\/\/doi.org\/10.1007\/s13675-013-0014-z","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2013,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Lagrangian decompositions for the two-level FTTx network design problem","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-013-0014-z","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}