{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T03:16:38Z","timestamp":1787714198979,"version":"build-2784847793"},"publisher-location":"Boston, MA","reference-count":42,"publisher":"Springer US","isbn-type":[{"value":"9780387306629","type":"print"},{"value":"9780387301655","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-30165-5_13","type":"book-chapter","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T12:26:59Z","timestamp":1228825619000},"page":"313-339","source":"Crossref","is-referenced-by-count":4,"title":["Telecommunications Access Network Design"],"prefix":"10.1007","author":[{"given":"Tamra","family":"Carpenter","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanan","family":"Luss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"K. I. Aardal, S. P. M. van Hoesel, A. M. C. A. Koster, C. Mannino, and A. Sassano. Models and solution techniques for frequency assignment problems. Technical Report 01-40, Zentrum fur Informationstechnik Berlin, December 2001. Available on \n                  http:\/\/fap.zib.de\/survey\/index.html\n                  \n                ."},{"key":"13_CR2","unstructured":"G. Abe. Residential broadband. Macmillan Technical Publishing, 1997."},{"key":"13_CR3","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: Theory, algorithms, and applications. Prentice Hall, 1993."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s00453-002-0968-3","volume":"34","author":"M. Andrews","year":"2002","unstructured":"M. Andrews and L. Zhang. Approximation algorithms for access network design. Algorithmica, 34:197\u2013215, 2002.","journal-title":"Algorithmica"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF02071976","volume":"33","author":"A. Balakrishnan","year":"1991","unstructured":"A. Balakrishnan, T L. Magnanti, A. Shulman, and R. T. Wong. Models for planning capacity expansion in local access telecommunications networks. Annals of Operations Research, 33:239\u2013284, 1991.","journal-title":"Annals of Operations Research"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/opre.43.1.58","volume":"43","author":"A. Balakrishnan","year":"1995","unstructured":"A. Balakrishnan, T. L. Magnanti, and R. T. Wong. A decomposition algorithm for local access telecommunications network expansion planning. Operations Research, 43: 58\u201376, 1995.","journal-title":"Operations Research"},{"key":"13_CR7","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, 2000."},{"key":"13_CR8","unstructured":"C. Behrens, T. Carpenter, M. Eiger, Y. Ho, and P. Seymour. Enhanced xDSL planning. In Proceedings of the 17th Annual National Fiber Optic Engineers Conference, 2001."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1023\/A:1016671128891","volume":"16","author":"D. Bienstock","year":"2001","unstructured":"D. Bienstock and I. Saniee. ATM network design: Traffic models and optimization-based heuristics. Telecommunication Systems, 16:399\u2013421, 2001.","journal-title":"Telecommunication Systems"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"L. D. Bodin","year":"1983","unstructured":"L. D. Bodin, B. L. Golden, A. A. Assad, and M. O. Ball. Routing and scheduling of vehicles and crews. Computers and Operations Research, 10(2):63\u2013211, 1983.","journal-title":"Computers and Operations Research"},{"key":"13_CR11","unstructured":"T. Carpenter, M. Eiger, P. Seymour, and D. Shallcross. Automated design of fiber-to-the-curb and hybrid fiber-coax access networks. In Proceedings of the 12th Annual National Fiber Optic Engineers Conference, 1996."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1014565826357","volume":"106","author":"T. Carpenter","year":"2001","unstructured":"T. Carpenter, M. Eiger, P. Seymour, and D. Shallcross. Node placement and sizing for copper broadband access networks. Annals of Operations Research, 106:199\u2013228, 2001.","journal-title":"Annals of Operations Research"},{"key":"13_CR13","unstructured":"W. Ciciora, J. Farmer, and D. Large. Modern cable television technology: Video, voice, and data communications. Morgan Kaufmann, 1999."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"M. S. Daskin. Network and discrete location: Models, algorithms, and applications. John Wiley, 1995.","DOI":"10.1002\/9781118032343"},{"key":"13_CR15","first-page":"207","volume":"1","author":"M. Eiger","year":"1996","unstructured":"M. Eiger. Coaxial network modeling and engineering. In Proceedings of the International Conference on Telecommunications, volume 1, pages 207\u2013210, 1996.","journal-title":"Proceedings of the International Conference on Telecommunications"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1002\/(SICI)1520-6750(199908)46:5<487::AID-NAV3>3.0.CO;2-B","volume":"46","author":"L. F. Frantzeskakis","year":"1999","unstructured":"L. F. Frantzeskakis and H. Luss. The network redesign problem for access telecommunications networks. Naval Research Logistics, 46:487\u2013506, 1999.","journal-title":"Naval Research Logistics"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02061657","volume":"33","author":"B. Gavish","year":"1991","unstructured":"B. Gavish. Topological design of telecommunications networks \u2014 Local access design methods. Annals of Operations Research, 33:17\u201371, 1991.","journal-title":"Annals of Operations Research"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0377-2217(92)90204-M","volume":"58","author":"B. Gavish","year":"1992","unstructured":"B. Gavish. Topological design of computer communication networks \u2014 The overall design problem. European Journal of Operations Research, 58:149\u2013172, 1992.","journal-title":"European Journal of Operations Research"},{"key":"13_CR19","first-page":"159","volume":"2","author":"M. Gawande","year":"1999","unstructured":"M. Gawande, J. G. Klincewicz, and H. Luss. Design of SONET ring networks for local access. Advances in Performance Analysis, 2:159\u2013173, 1999.","journal-title":"Advances in Performance Analysis"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1014517910427","volume":"106","author":"A. Girard","year":"2001","unstructured":"A. Girard, B. Sanso, and L. Dadjo. A tabu search algorithm for access network design. Annals of Operations Research, 106:229\u2013262, 2001.","journal-title":"Annals of Operations Research"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/A:1019184615054","volume":"7","author":"L. Gouveia","year":"1997","unstructured":"L. Gouveia and M. J. Lopes. Using generalized capacitated trees for designing the topology of local access networks. Telecommunication Systems, 7:315\u2013337, 1997.","journal-title":"Telecommunication Systems"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0377-2217(99)00070-3","volume":"123","author":"R. Gupta","year":"2000","unstructured":"R. Gupta and H. Pirkul. Hybrid fiber co-axial CATV network design with variable capacity optical network units. European Journal of Operational Research, 123: 73\u201385, 2000.","journal-title":"European Journal of Operational Research"},{"key":"13_CR23","doi-asserted-by":"publisher","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-center problem on trees. Transportation Science, 28:167\u2013175, 1994.","journal-title":"Transportation Science"},{"key":"13_CR24","doi-asserted-by":"publisher","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-centers. SIAM Journal of Applied Mathematics, 37:513\u2013538, 1979.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0966-8349(98)00042-4","volume":"6","author":"J. G. Klincewicz","year":"1998","unstructured":"J. G. Klincewicz. Hub location in backbone\/tributary network design: A review. Location Science, 6:307\u2013335, 1998.","journal-title":"Location Science"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1057\/jors.1986.84","volume":"37","author":"J. G. Klincewicz","year":"1986","unstructured":"J. G. Klincewicz and H. Luss. A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints. Journal of the Operational Research Society, 37:495\u2013500, 1986.","journal-title":"Journal of the Operational Research Society"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/S0305-0548(98)00005-7","volume":"25","author":"J. G. Klincewicz","year":"1998","unstructured":"J. G. Klincewicz, H. Luss, and D. C. K. Yan. Designing tributary networks with multiple ring families. Computers and Operations Research, 25:1145\u20131157, 1998.","journal-title":"Computers and Operations Research"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1057\/jors.1993.83","volume":"44","author":"C. Lee","year":"1993","unstructured":"C. Lee. An algorithm for the design of multitype concentrator networks. Journal of the Operational Research Society, 44:471\u2013482, 1993.","journal-title":"Journal of the Operational Research Society"},{"key":"13_CR29","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1287\/opre.30.5.907","volume":"30","author":"H. Luss","year":"1982","unstructured":"H. Luss. Operations research and capacity expansion problems: A survey. Operations Research, 30:907\u2013947, 1982.","journal-title":"Operations Research"},{"key":"13_CR30","unstructured":"T. Magnanti and L. Wolsey. Optimal trees. In M. Ball, T. Magnanti, C. Monma, and G. Nemhauser, editors, Network Routing, volume 7 of Handbooks in Operations Research and Management Science, chapter 9. North-Holland, 1995."},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1019147029476","volume":"15","author":"G. R. Mateus","year":"2000","unstructured":"G. R. Mateus and R. V. L. Franqueira. Model and heuristic for a generalized access network design problem. Telecommunication Systems, 15:257\u2013271, 2000.","journal-title":"Telecommunication Systems"},{"key":"13_CR32","unstructured":"D. Mazur. Integer programming approaches to a multi-facility location problem. PhD thesis, Johns Hopkins University, 1999."},{"key":"13_CR33","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/opre.50.3.538.7737","volume":"50","author":"R. A. Patterson","year":"2002","unstructured":"R. A. Patterson and E. Rolland. Hybrid fiber coaxial network design. Operations Research, 50:538\u2013551, 2002.","journal-title":"Operations Research"},{"issue":"2","key":"13_CR34","first-page":"36","volume":"30","author":"A. Philpott","year":"2003","unstructured":"A. Philpott, A. Mason, and J. Davenport. \u2018FIDO\u2019: Telecom\u2019s best friend. OR\/MS Today, 30(2):36\u201341, April 2003.","journal-title":"OR\/MS Today"},{"key":"13_CR35","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","volume":"14","author":"H. Pirkul","year":"1987","unstructured":"H. Pirkul. Efficient algorithms for the capacitated concentrator location problem. Computers and Operations Research, 14:197\u2013208, 1987.","journal-title":"Computers and Operations Research"},{"key":"13_CR36","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0140-3664(92)90079-T","volume":"15","author":"H. Pirkul","year":"1992","unstructured":"H. Pirkul and S. Narasimhan. Hierarchical concentrator location problem. Computer Communications, 15:185\u2013191, 1992.","journal-title":"Computer Communications"},{"key":"13_CR37","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/26.2769","volume":"36","author":"H. Pirkul","year":"1988","unstructured":"H. Pirkul, S. Narasimhan, and P. De. Locating concentrators for primary and secondary coverage in a computer communications network. IEEE Transactions on Communications, 36:450\u2013458, 1988.","journal-title":"IEEE Transactions on Communications"},{"key":"13_CR38","unstructured":"R. Ramaswami and K. N. Sivarajan. Optical networks: A practical perspective. Morgan Kaufmann Publishers, second edition, 2002."},{"key":"13_CR39","unstructured":"C. R. Reeves, editor. Modern heuristic techniques for combinatorial problems. John Wiley, 1993."},{"key":"13_CR40","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1023\/A:1016623229800","volume":"16","author":"E. Rosenberg","year":"2001","unstructured":"E. Rosenberg. Dual ascent for uncapacitated telecommunications network design with access, backbone and switch Costs. Telecommunication Systems, 16:423\u2013435, 2001.","journal-title":"Telecommunication Systems"},{"key":"13_CR41","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1287\/opre.19.1.156","volume":"19","author":"B. Rothfarb","year":"1971","unstructured":"B. Rothfarb and M. Goldstein. The one-terminal TELPAK problem. Operations Research, 19:156\u2013169, 1971.","journal-title":"Operations Research"},{"key":"13_CR42","unstructured":"S. Taylor, N. Boland, and A. Philpott. Optimal spanning trees with attenuation and amplification. In Proceedings of the 15th National Conference of the Australian Society for Operations Research, pages 1225\u20131244, 1999."}],"container-title":["Handbook of Optimization in Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30165-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T02:11:45Z","timestamp":1619575905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-30165-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387306629","9780387301655"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30165-5_13","relation":{},"subject":[]}}