{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:30:47Z","timestamp":1759667447243},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf02136155","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T07:17:37Z","timestamp":1126768657000},"page":"51-76","source":"Crossref","is-referenced-by-count":30,"title":["A comparison of directed formulations for the capacitated minimal spanning tree problem"],"prefix":"10.1007","volume":"1","author":[{"given":"Luis","family":"Gouveia","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02136155_CR1","unstructured":"J. Araque, A polyhedral approach to vehicle routing, presented at the ORSA\/TIMS Joint National Meeting (1989)."},{"key":"BF02136155_CR2","unstructured":"J. Araque, L. Hall and T. Magnanti, Capacitated trees, capacitated routing and associated polyhedra, C.O.R.E. Discussion Paper (1990)."},{"key":"BF02136155_CR3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"B. Gavish","year":"1982","unstructured":"B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, Networks 12(1982)355\u2013377.","journal-title":"Networks"},{"key":"BF02136155_CR4","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322358.322367","volume":"30","author":"B. Gavish","year":"1983","unstructured":"B. Gavish, Topological design of centralized computer networks: Formulations and algorithms, J. ACM 30(1983)118\u2013132.","journal-title":"J. ACM"},{"key":"BF02136155_CR5","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":"BF02136155_CR6","unstructured":"B. Gavish and K. Altinkemer, Parallel savings heuristics for the topological design of local access tree networks, in:Proc. IEEE INFOCOM 86 Conf. (1986)."},{"key":"BF02136155_CR7","volume-title":"Graphs and Algorithms","author":"M. Gondran","year":"1984","unstructured":"M. Gondran and M. Minoux,Graphs and Algorithms (Wiley, New York, 1984)."},{"key":"BF02136155_CR8","unstructured":"L. Gouveia, Determina\u00e7\u00e3o da arvore de suporte de custo m\u00ednimo com restri\u00e7\u00f5es de capacidade: Formula\u00e7\u00f5es e algoritmos, Ph.D. Thesis, University of Lisbon (May 1991)."},{"key":"BF02136155_CR9","unstructured":"L. Gouveia, A 2n-constraint formulation for the capacitated minimal spanning tree problem, presented at theEuro XI Conf. (July, 1991) and at theWorkshop on Large-Scale Optimization, Coimbra (July 1991)."},{"key":"BF02136155_CR10","doi-asserted-by":"crossref","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."},{"key":"BF02136155_CR11","unstructured":"L. Gouveia and J. Paix\u00e3o, A state space relaxation for the capacitated minimal spanning tree problem, presented at theEURO XI Conf. (July 1991) and at theWorkshop on Large-Scale Optimization, Coimbra (July 1991)."},{"key":"BF02136155_CR12","unstructured":"L. Gouveia, A. Lucena and J. Paix\u00e3o, A set-partitioning approach for the capacitated minimal spanning tree problem, presented at theEuro X Conf., Belgrade (June 1989) and at the1st ORSA Telecommunications SIG Conf., Operations Research in Telecommunications, Boca Raton (March 1990)."},{"key":"BF02136155_CR13","unstructured":"L.A. Hall, Two topics in discrete optimizations: Polyhedral structure of capacitated trees and approximation algorithms for scheduling, Ph.D. Thesis, MIT (1989)."},{"key":"BF02136155_CR14","doi-asserted-by":"crossref","first-page":"1762","DOI":"10.1109\/TCOM.1974.1092123","volume":"COM-22","author":"A. Kershenbaum","year":"1974","unstructured":"A. Kershenbaum and W. Chou, A unified algorithm for designing multidrop teleprocessing networks, IEEE Trans. Commun. COM-22(1974)1762\u20131772.","journal-title":"IEEE Trans. Commun."},{"key":"BF02136155_CR15","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, Actas do 4o Congresso Portugu\u00eas de Inform\u00e1tica 2b(1986)1625\u20131655.","journal-title":"Actas do 4o Congresso Portugu\u00eas de Inform\u00e1tica"},{"key":"BF02136155_CR16","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":"BF02136155_CR17","unstructured":"A. Tanenbaum,Computer Networks (Prentice-Hall, 1977)."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02136155.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02136155\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02136155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T09:22:46Z","timestamp":1557825766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02136155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02136155"],"URL":"https:\/\/doi.org\/10.1007\/bf02136155","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}