{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T15:29:26Z","timestamp":1773242966985,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1016\/s0377-2217(99)00340-9","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"189-202","source":"Crossref","is-referenced-by-count":16,"title":["A dynamic programming algorithm for the local access telecommunication network expansion problem"],"prefix":"10.1016","volume":"127","author":[{"given":"Olaf E.","family":"Flippo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoon W.J.","family":"Kolen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arie M.C.A.","family":"Koster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert L.M.J.","family":"van de Leensel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0377-2217(99)00340-9_BIB1","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/S0377-2217(96)90072-7","article-title":"Optimal expansion of capacitated transshipment networks","volume":"89","author":"Ahuja","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/S0377-2217(99)00340-9_BIB2","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/mnsc.40.5.567","article-title":"A dual-based algorithm for multi-level network design","volume":"40","author":"Balakrishnan","year":"1994","journal-title":"Management Science"},{"issue":"7","key":"10.1016\/S0377-2217(99)00340-9_BIB3","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":"Management Science"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02071976","article-title":"Models for planning capacity expansion in local access telecommunication networks","volume":"33","author":"Balakrishnan","year":"1991","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(99)00340-9_BIB5","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.43.1.58","article-title":"A decomposition algorithm for local access telecommunications network expansion planning","volume":"43","author":"Balakrishnan","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02579383","article-title":"Pacing and covering a tree by subtrees","volume":"6","author":"Barany","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF02136170","article-title":"Computational experience with an effective heuristic for some capacity expansion problems in local access networks","volume":"1","author":"Bienstock","year":"1993","journal-title":"Telecommunication Systems"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01581104","article-title":"Minimum cost capacity installation for multicommodity network flows","volume":"81","author":"Bienstock","year":"1998","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","article-title":"Capacitated network design \u2013 Polyhedral structure and computation","volume":"8","author":"Bienstock","year":"1996","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"10.1016\/S0377-2217(99)00340-9_BIB10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/opre.43.1.43","article-title":"Lower bounding procedures for multiperiod telecommunications network expansion problems","volume":"43","author":"Chang","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB11","unstructured":"G. Cho, D.X. Shaw, Limited column generation for local access telecommunication network design \u2013 Formulations, algorithms, and implementation, Working Paper, January 1995"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB12","unstructured":"O. Flippo, A. Kolen, A. Koster, R. van de Leensel, A dynamic programming algorithm for the local access network expansion problem, Research Memorandum 96\/027, Maastricht University, 1996"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02061657","article-title":"Topological design of telecommunication networks: Local access design networks","volume":"33","author":"Gavish","year":"1991","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(99)00340-9_BIB14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0377-2217(92)90204-M","article-title":"Topological design of computer communication networks \u2013 The overall design problem","volume":"58","author":"Gavish","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB15","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02071978","article-title":"Dynamic programming based heuristics for the topological design of local access networks","volume":"33","author":"Gouveia","year":"1991","journal-title":"Annals of Operations Research"},{"issue":"7","key":"10.1016\/S0377-2217(99)00340-9_BIB16","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1287\/opre.40.2.309","article-title":"Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints","volume":"40","author":"Gr\u00f6tschel","year":"1992","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/S0377-2217(99)00340-9_BIB17","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1287\/opre.43.6.1012","article-title":"Polyhedral and computational investigations for designing communication networks with high survivability requirements","volume":"43","author":"Gr\u00f6tschel","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB18","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0167-6377(92)90100-H","article-title":"A characterization of the uncapacitated network design polytope","volume":"12","author":"Hellstrand","year":"1992","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB19","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1287\/opre.40.1.14","article-title":"Design and implementation of an interactive optimization system for telephone network planning","volume":"40","author":"Jack","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.8.1.1","article-title":"On knapsacks, partitions and a new dynamic programming technique for trees","volume":"8","author":"Johnson","year":"1983","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","article-title":"Network design and transportation planning: Models and algorithms","volume":"18","author":"Magnanti","year":"1984","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB22","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02094332","article-title":"Locating concentrators in centralized computer networks","volume":"36","author":"Pirkul","year":"1992","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(99)00340-9_BIB23","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0377-2217(94)00056-I","article-title":"A suboptimal solution to a hierarchial network design problem using dynamic programming","volume":"83","author":"Sancho","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00340-9_BIB24","doi-asserted-by":"crossref","unstructured":"A. Shulman, R. Vachani, An algorithm for capacity expansion of local access networks, in: IEEE Infocom'90, San Francisco, California, 1990","DOI":"10.1109\/INFCOM.1990.91253"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003409?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003409?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:54:26Z","timestamp":1556452466000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799003409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0377221799003409"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00340-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}