{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:17:34Z","timestamp":1648711054916},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2006,12,18]]},"DOI":"10.1007\/s11235-006-9019-8","type":"journal-article","created":{"date-parts":[[2006,11,30]],"date-time":"2006-11-30T13:51:04Z","timestamp":1164894664000},"page":"353-376","source":"Crossref","is-referenced-by-count":1,"title":["Protecting local access telecommunications networks: Toward a minimum-cost solution"],"prefix":"10.1007","volume":"33","author":[{"given":"M. J.","family":"O\u2019Sullivan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. G.","family":"Walker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. L.","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. D.","family":"Thompson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. B.","family":"Philpott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,1]]},"reference":[{"key":"9019_CR1","unstructured":"A. Atamt\u00fcrk, On capacitated network design cut-set polyhedra, Technical report, IEOR Department, University of California at Berkeley. (2000) Available at http:\/\/ieor.berkeley.edu\/~atamturk ."},{"issue":"4","key":"9019_CR2","doi-asserted-by":"crossref","first-page":"237","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 telecommunication networks, Annals of Operations Research 33(4) (1991) 237\u2013284.","journal-title":"Annals of Operations Research"},{"key":"9019_CR3","doi-asserted-by":"crossref","unstructured":"A. Balakrishnan, T.L. Magnanti and R.T. Wong, A Decomposition algorithm for local access elecommunications network expansion planning, Operations Research 43(1) (1995) 58\u201376. Special Issue on Telecommunications Systems: Modeling, Analysis and Design.","DOI":"10.1287\/opre.43.1.58"},{"key":"9019_CR4","doi-asserted-by":"crossref","unstructured":"F. Barahona, Network design using cut inequalities, SIAM Journal on Optimization (1996) 823\u2013837.","DOI":"10.1137\/S1052623494279134"},{"key":"9019_CR5","first-page":"177","volume":"81","author":"D. Bienstock","year":"1998","unstructured":"D. Bienstock, S. Chopra and O. Gunluk, Minimum cost capacity installation for multicommodity network flows, Mathematical Programming 81 (1998) 177\u2013199.","journal-title":"Mathematical Programming"},{"key":"9019_CR6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","volume":"8","author":"D. Bienstock","year":"1996","unstructured":"D. Bienstock and O. Gunluk, Capacitated network design\u2014Polyhedral structure and computation, INFORMS Journal on Computing 8 (1996) 243\u2013259.","journal-title":"INFORMS Journal on Computing"},{"key":"9019_CR7","volume-title":"Computers and intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and intractability: A Guide to the Theory of NP-Completeness, W. H Freeman and Company. (San Francisco, CA, 1979)."},{"issue":"1","key":"9019_CR8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02061657","volume":"33","author":"B. Gavish","year":"1991","unstructured":"B. Gavish, Topological design of telecommunication networks-local access design methods, Annals of Operations Research 33(1) (1991) 17\u201371.","journal-title":"Annals of Operations Research"},{"key":"9019_CR9","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1016\/0377-2217(95)00305-3","volume":"95","author":"J.W. Herrmann","year":"1996","unstructured":"J.W. Herrmann, G. Ioannou, I. Minis and J.M. Proth, A dual ascent approach to the fixed-charge capacitated network design problem, European Journal of Operational Research 95 (1996) 476\u2013490.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"9019_CR10","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K. Holmberg","year":"2000","unstructured":"K. Holmberg and D. Yuan, A Lagrangean heuristic based branch-and-bound method for the capacitated network design problem, Operations Research 48(3)(2000) 461\u2013481.","journal-title":"Operations Research"},{"key":"9019_CR11","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T.L. Magnanti","year":"1995","unstructured":"T.L. Magnanti, P. Mirchandani and R. Vachani, Modeling and solving the capacitated network loading problem, Operations Research 43 (1995) 142\u2013157.","journal-title":"Operations Research"},{"key":"9019_CR12","unstructured":"A.J. Mason and A.B. Philpott, Development of FIDO\u2014A network design tool for fibre cable layout, in: Proceedings of 36th Annual ORSNZ Conference, ORSNZ (2001) pp. 120\u2013129."},{"key":"9019_CR13","unstructured":"M.L. O\u2019Sullivan, Optimal fibre-optic in cable layout using Dynamic Programming, in: Proceedings of 37th Annual ORSNZ Conference, ORSNZ, (2002) pp. 117\u2013128."},{"key":"9019_CR14","unstructured":"M.L. O\u2019Sullivan, Optimal fibre-optic in cable layout using Dynamic Programming, Master\u2019s thesis, Department of Engineering Science, University of Auckland (2002)."},{"key":"9019_CR15","unstructured":"A.B. Philpott, A.J. Mason and J. Davenport, FIDO\u2014Telecom\u2019s best friend, OR\/MS Today, April 2003, (2003) pp. 36\u201341."},{"key":"9019_CR16","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/S0377-2217(99)00272-6","volume":"125","author":"V. Sridhar","year":"2000","unstructured":"V. Sridhar and J.S. Park, Benders-and-cut algorithm for fixed-charge capacitated network design problem, European Journal of Operational Research 125 (2000) 622\u2013632.","journal-title":"European Journal of Operational Research"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-006-9019-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-006-9019-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-006-9019-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:47:09Z","timestamp":1559371629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-006-9019-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,1]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,12,18]]}},"alternative-id":["9019"],"URL":"https:\/\/doi.org\/10.1007\/s11235-006-9019-8","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,1]]}}}