{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:27:08Z","timestamp":1759667228877,"version":"3.43.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"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":["Telecommunication Systems"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1023\/a:1019184615054","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T18:30:27Z","timestamp":1045679427000},"page":"315-337","source":"Crossref","is-referenced-by-count":16,"title":["Using generalized capacitated trees for designing the topology of local access networks"],"prefix":"10.1007","volume":"7","author":[{"given":"Luis","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"Maria Jo\u00e3o","family":"Lopes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"K. Altinkemer, Parallel savings heuristics for designing multicenter tree networks, Technical Report (1989).","key":"329656_CR1"},{"unstructured":"A. Amberg, W. Domschke and S. Vo\u00df, Capacitated minimum spanning trees: algorithms using intelligent search, Technical Report, Technische Universit\u00e4t Braunschweig (1995).","key":"329656_CR2"},{"unstructured":"J. Coimbra and L. Gouveia, Lower bounding and upper bounding methods for a K-cardinality minimal tree problem, paper presented at the 3rd INFORMS Telecommunications Conference, Boca Raton (March 1995).","key":"329656_CR3"},{"key":"329656_CR4","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1147\/sj.53.0142","volume":"5","author":"L. Esau","year":"1966","unstructured":"L. Esau and K. Williams, On teleprocessing system design, Part II: A method for approximating the optimal network, IBM Syst. J. 5 (1966) 142\u2013147.","journal-title":"IBM Syst. J."},{"issue":"1","key":"329656_CR5","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. Assoc. Comput. Mach. 30(1) (1983) 118\u2013132.","journal-title":"J. Assoc. Comput. Mach."},{"key":"329656_CR6","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1109\/TCOM.1985.1096250","volume":"33","author":"B. Gavish","year":"1985","unstructured":"B. Gavish, Augmented Lagrangian based algorithms for centralized network design, IEEE Trans. Commun. 33 (1985) 1247\u20131257.","journal-title":"IEEE Trans. Commun."},{"key":"329656_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02061657","volume":"33","author":"B. Gavish","year":"1991","unstructured":"B. Gavish, Topological design of telecommunication networks - survey of local access network design methods, Ann. Oper. Res. 33 (1991) 17\u201371.","journal-title":"Ann. Oper. Res."},{"unstructured":"B. Gavish and K. Altinkemer, Parallel savings heuristics for the topological design of local access tree networks, in: '86 Conference (1986).","key":"329656_CR8"},{"key":"329656_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF02136155","volume":"1","author":"L. Gouveia","year":"1993","unstructured":"L. Gouveia, A comparison of directed formulations for the capacitated minimal spanning tree problem, Telecommunications Systems 1 (1993) 51\u201376.","journal-title":"Telecommunications Systems"},{"key":"329656_CR10","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.43.1.130","volume":"43","author":"L. Gouveia","year":"1995","unstructured":"L. Gouveia, A 2n-constraint formulation for the capacitated minimal spanning tree problem, Oper. Res. 43 (1995) 130\u2013141.","journal-title":"Oper. Res."},{"unstructured":"L. Gouveia and P. Martins, An extended flow based formulation for the capacitated minimal spanning tree problem, paper presented at the 3rd INFORMS Telecommunications Conference, Boca Raton (March 1995).","key":"329656_CR11"},{"key":"329656_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF02071978","volume":"33","author":"L. Gouveia","year":"1991","unstructured":"L. Gouveia and J. Paix\u00e3o, Dynamic programming based heuristics for the topological design of local access networks, Ann. Oper. Res. 33 (1991) 305\u2013327.","journal-title":"Ann. Oper. Res."},{"unstructured":"L. Hall, Integer programming formulations for designing a centralized processing network, Technical Report, Department of Mathematical Sciences, Johns Hopkins University (1993).","key":"329656_CR13"},{"key":"329656_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/ijoc.8.3.219","volume":"8","author":"L. Hall","year":"1996","unstructured":"L. Hall, Experience with a cutting plane approach for the capacitated spanning tree problem, INFORMS J. Computing 8 (1996) 219\u2013234.","journal-title":"INFORMS J. Computing"},{"issue":"5","key":"329656_CR15","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1109\/TCOM.1976.1093334","volume":"24","author":"M. Karnaugh","year":"1976","unstructured":"M. Karnaugh, A new class of algorithms for multipoint network optimization, IEEE Trans. Commun. 24(5) (1976) 500\u2013505.","journal-title":"IEEE Trans. Commun."},{"issue":"10","key":"329656_CR16","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.1109\/TCOM.1980.1094601","volume":"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. 28(10) (1980) 1835\u20131838.","journal-title":"IEEE Trans. Commun."},{"unstructured":"M.J. Lopes, \u00c1rvore de suporte de custo m\u00ednimo com restri\u00e7\u00f5es de capacidade em dois n\u00edveis, Master Thesis, Faculdade de Ci\u00eancias da Universidade de Lisboa (January 1993).","key":"329656_CR17"},{"doi-asserted-by":"crossref","unstructured":"T. Magnanti and L. Wolsey, Optimal trees, in: Network Models, Handbooks in Operations Research and Management Science 7 (1995) pp. 503\u2013615.","key":"329656_CR18","DOI":"10.1016\/S0927-0507(05)80126-4"},{"key":"329656_CR19","first-page":"1625","volume":"2b","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, in: Actas do 4\u00b0Congresso Portugu\u00eas de Inform\u00e1tica, Vol. 2b (1986) pp. 1625\u20131655.","journal-title":"Actas do 4\u00b0 Congresso Portugu\u00eas de Inform\u00e1tica"},{"key":"329656_CR20","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"},{"unstructured":"Y. Sharaiha, M. Gendreau, G. Laporte and I. Osman, A Tabu Search algorithm for the capacitated shortest spanning tree problem, Technical Report CRT-95\u201379, C.R.T., Universit\u00e9 de Montreal (1995).","key":"329656_CR21"},{"key":"329656_CR22","volume-title":"Computer Networks","author":"A. Tanenbaum","year":"1977","unstructured":"A. Tanenbaum, Computer Networks (Prentice-Hall, Englewood Cliffs, NJ, 1977)."},{"unstructured":"S. Vo\u00df, Steiner-Probleme in Graphen, Mathematical Systems in Economics 120 (Anton Hain Verlag, 1990).","key":"329656_CR23"},{"key":"329656_CR24","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R. Wong","year":"1984","unstructured":"R. Wong, A dual ascent approach to Steiner tree problems on a directed graph, Math. Programming 28 (1984) 271\u2013287.","journal-title":"Math. Programming"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019184615054.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019184615054\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019184615054.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:32:47Z","timestamp":1754634767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019184615054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["329656"],"URL":"https:\/\/doi.org\/10.1023\/a:1019184615054","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}