{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:55:43Z","timestamp":1761893743771,"version":"3.40.5"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1023\/a:1014565826357","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T20:42:43Z","timestamp":1041108163000},"page":"199-228","source":"Crossref","is-referenced-by-count":7,"title":["Node Placement and Sizing for Copper Broadband Access Networks"],"prefix":"10.1007","volume":"106","author":[{"given":"Tamra","family":"Carpenter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Eiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Shallcross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"398743_CR1","volume-title":"Residential Broadband","author":"G. Abe","year":"1997","unstructured":"G. Abe, Residential Broadband (Macmillan, Indianapolis, IN, 1997)."},{"key":"398743_CR2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02071976","volume":"33","author":"A. Balakrishnan","year":"1991","unstructured":"A. Balakrishnan, T. Magnanti, A. Shulman and R. Wong, Models for planning capacity expansion in local access telecommunication networks, Annals of Operations Research 33 (1991) 239\u2013284.","journal-title":"Annals of Operations Research"},{"key":"398743_CR3","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.43.1.58","volume":"43","author":"A. Balakrishnan","year":"1995","unstructured":"A. Balakrishnan, T. Magnanti and R. Wong, A decomposition algorithm for local access network expansion planning, Operations Research 43 (1995) 58\u201376.","journal-title":"Operations Research"},{"key":"398743_CR4","unstructured":"C. Behrens, T. Carpenter, M. Eiger, Y. Ho, H. Luss, G. Seymour, P. Seymour and G. Truax, Network planning for xDSL, in: Proceedings of the 16th Annual National Fiber Optic Engineers Conference, Denver, CO (2000)."},{"key":"398743_CR5","unstructured":"T. Carpenter, M. Eiger, P. Seymour and D. Shallcross, Automated design of fiber\u2013to\u2013the\u2013curb and hybrid fiber\u2013coax access networks, in: Proceedings of the 12th Annual National Fiber Optic Engineers Conference, Denver, CO (1996)."},{"key":"398743_CR6","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0377-2217(91)90261-S","volume":"50","author":"G. Cornuejols","year":"1991","unstructured":"G. Cornuejols, R. Sridharan and J.\u2013M. Thizy, A comparison of heuristics and relaxations for the capacitated plant location problem, European Journal of Operational Research 50 (1991) 280\u2013297.","journal-title":"European Journal of Operational Research"},{"key":"398743_CR7","first-page":"16","volume":"2","author":"S. Cray","year":"2000","unstructured":"S. Cray, E. Gallo and R. Warner, Realizing the potential of DSL, Telcordia Exchange Magazine 2 (2000) 16\u201321.","journal-title":"Telcordia Exchange Magazine"},{"key":"398743_CR8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/trsc.28.2.167","volume":"28","author":"M. Jaeger","year":"1994","unstructured":"M. Jaeger and J. Goldberg, A polynomial algorithm for the equal capacity p\u2013center problem on trees, Transportation Science 28 (1994) 167\u2013175.","journal-title":"Transportation Science"},{"key":"398743_CR9","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"O. Kariv and S. Hakimi, An algorithmic approach to network location problems. I: The p\u2013centers, SIAM Journal of Applied Mathematics 37 (1979) 513\u2013538.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"398743_CR10","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1986.84","volume":"37","author":"J. Klincewicz","year":"1986","unstructured":"J. Klincewicz and H. Luss, A Lagrangian relaxation heuristic for capacitated facility location with single\u2013source constraints, Journal of the Operational Research Society 37 (1986) 495\u2013500.","journal-title":"Journal of the Operational Research Society"},{"key":"398743_CR11","series-title":"Handbooks in Operations Research and Management Science","volume-title":"Network Routing","author":"T. Magnanti","year":"1995","unstructured":"T. Magnanti and L.Wolsey, Optimal trees, in: Network Routing, eds.M. Ball, T. Magnanti, C. Monma and G. Nemhauser, Handbooks in Operations Research and Management Science, Vol. 7 (North\u2013Holland, Amsterdam, 1995) chapter 9."},{"key":"398743_CR12","volume-title":"Integer programming approaches to a multi\u2013facility location problem","author":"D. Mazur","year":"1999","unstructured":"D. Mazur, Integer programming approaches to a multi\u2013facility location problem, Ph.D. thesis, Johns Hopkins University, Baltimore, MD (1999)."},{"key":"398743_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0377-2217(93)90329-L","volume":"65","author":"C. ReVelle","year":"1993","unstructured":"C. ReVelle, Facility siting and integer\u2013friendly programming, European Journal of Operational Research 65 (1993) 147\u2013158.","journal-title":"European Journal of Operational Research"},{"key":"398743_CR14","volume-title":"Families of subtrees and the optical network unit placement problem","author":"K. Williams","year":"1997","unstructured":"K.Williams, Families of subtrees and the optical network unit placement problem, B.A. thesis, Princeton University, Princeton, NJ (1997)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014565826357.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1014565826357\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014565826357.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:13:47Z","timestamp":1747577627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1014565826357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":14,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["398743"],"URL":"https:\/\/doi.org\/10.1023\/a:1014565826357","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}