{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:09:51Z","timestamp":1759666191638},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1007\/bf02071978","type":"journal-article","created":{"date-parts":[[2005,8,13]],"date-time":"2005-08-13T17:02:28Z","timestamp":1123952548000},"page":"305-327","source":"Crossref","is-referenced-by-count":21,"title":["Dynamic programming based heuristics for the topological design of local access networks"],"prefix":"10.1007","volume":"33","author":[{"given":"L.","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"J.","family":"Paix\u00e3o","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02071978_CR1","unstructured":"K. Altinkemer and B. Gavish, Parallel savings based heuristic for the delivery problem, Working Paper (1988)."},{"key":"BF02071978_CR2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/mnsc.34.3.331","volume":"34","author":"K. Altinkemer","year":"1988","unstructured":"K. Altinkemer and B. Gavish, Heuristics with constant error guarantees for the design of tree networks, Manag. Sci. 34(1988)331\u2013341.","journal-title":"Manag. Sci."},{"key":"BF02071978_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230030204","volume":"3","author":"K. Chandy","year":"1973","unstructured":"K. Chandy and T. Lo, The capacitated minimum spanning tree, Networks 3(1973)173\u2013181.","journal-title":"Networks"},{"key":"BF02071978_CR4","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1109\/T-C.1972.223452","volume":"C-21","author":"K. Chandy","year":"1972","unstructured":"K. Chandy and R. Russell, The design of multipoint linkages in a teleprocessing tree network, IEEE Trans. Comp. C-21(1972)1062\u20131066.","journal-title":"IEEE Trans. Comp."},{"key":"BF02071978_CR5","unstructured":"L. Esau and K. Williams, A method for approximating the optimal network, IBM Syst. J. 581966)142\u2013147."},{"key":"BF02071978_CR6","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322358.322367","volume":"30","author":"B. Gavish","year":"1983","unstructured":"B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, J. ACM 30(1983)118\u2013132.","journal-title":"J. ACM"},{"key":"BF02071978_CR7","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TCOM.1985.1096250","volume":"COM-33","author":"B. Gavish","year":"1985","unstructured":"B. Gavish, Augmented Lagrangian based algorithms for centralized network design, IEEE Trans. Commun. COM-33(1985)1247\u20131257.","journal-title":"IEEE Trans. Commun."},{"key":"BF02071978_CR8","unstructured":"B. Gavish and K. Altinkemer, Parallel savings heuristic for the topological design of local access tree networks, in:Proc. IEEE INFOCOM 86 Conf. (1986)."},{"key":"BF02071978_CR9","unstructured":"B. Gavish, private communication (1989)."},{"key":"BF02071978_CR10","unstructured":"L. Gouveia and J. Paix\u00e3o, A dynamic programming formulation for the capacitated minimal spanning tree problem, Nota No. 6\/89 do CEAUL (1989)."},{"key":"BF02071978_CR11","unstructured":"L. Gouveia, A. Lucena and J. Paix\u00e3o, A set-partitioning approach for the capacitated minimal spanning tree problem, Paper presented at theEuro X Conf. (1989)."},{"key":"BF02071978_CR12","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/TCOM.1976.1093334","volume":"COM-24","author":"M. Karnaugh","year":"1976","unstructured":"M. Karnaugh, A new class of algorithms for multipoint network optimization, IEEE Trans. Commun. COM-24(1976)500\u2013505.","journal-title":"IEEE Trans. Commun."},{"key":"BF02071978_CR13","doi-asserted-by":"crossref","first-page":"1835","DOI":"10.1109\/TCOM.1980.1094601","volume":"COM-28","author":"A. Kershenbaum","year":"1980","unstructured":"A. Kershenbaum, R. Boorstyn and R. Oppenheim, Second-order greedy algorithms for centralized network design, IEEE Trans. Commun. COM-28(1980)1835\u20131838.","journal-title":"IEEE Trans. Commun."},{"key":"BF02071978_CR14","first-page":"1762","volume":"COM-22","author":"A. Kershenbaum","year":"1874","unstructured":"A. Kershenbaum and W. Chou, A unified algorithm for designing multidrop teleprocessing networks, IEEE Trans. Commun. COM-22(1874)1762\u20131772.","journal-title":"IEEE Trans. Commun."},{"key":"BF02071978_CR15","doi-asserted-by":"crossref","unstructured":"J. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7(1956).","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"BF02071978_CR16","first-page":"1625","volume":"2-b","author":"J. Paix\u00e3o","year":"1986","unstructured":"J. Paix\u00e3o and L. Gouveia, M\u00e9todos de investiga\u00e7\u00e3o operacional na idealiza\u00e7\u00e3o topol\u00f3gica de redes centralizadas, Actas do 40 Congresso Portugu\u00eas de Inform\u00e1tica, 2-b(1986)1625\u20131655.","journal-title":"Actas do 40 Congresso Portugu\u00eas de Inform\u00e1tica"},{"key":"BF02071978_CR17","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230080306","volume":"8","author":"C. Papadimitriou","year":"1978","unstructured":"C. Papadimitriou, The complexity of the capacitated tree problem, Networks 8(1978)217\u2013230.","journal-title":"Networks"},{"key":"BF02071978_CR18","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. Prim","year":"1957","unstructured":"R. Prim, Shortest connection networks and some generalizations, Bell. Syst. Tech. J. 36(1957)1389\u20131401.","journal-title":"Bell. Syst. Tech. J."},{"key":"BF02071978_CR19","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D. Rosenkrantz","year":"1977","unstructured":"D. Rosenkrantz, R. Stearns and P. Lewis, An analysis of several heuristics for the traveling salesman problem, SIAM J. Comput. 6(1977)563\u2013581.","journal-title":"SIAM J. Comput."},{"key":"BF02071978_CR20","unstructured":"R. Sharma and M. El-Bardai, Suboptimal communication network synthesis, in:Proc. Int. Conf. on Communications (1970)."},{"key":"BF02071978_CR21","unstructured":"A. Tannenbaum,Computer Networks (Prentice-Hall, 1977)."},{"key":"BF02071978_CR22","unstructured":"V. Whitney, Comparison of network topology optimization algorithms, in:Proc. Int. Conf. on Communications (1970)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02071978.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02071978\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02071978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:06:44Z","timestamp":1557778004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02071978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["BF02071978"],"URL":"https:\/\/doi.org\/10.1007\/bf02071978","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}