{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:05:13Z","timestamp":1747652713115,"version":"3.40.5"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"0","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":["Annals of Operations Research"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1023\/a:1018911003529","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"271-294","source":"Crossref","is-referenced-by-count":18,"title":["The Capacitated Minimal Spanning Tree Problem: An experiment with a hop\u2010indexedmodel"],"prefix":"10.1007","volume":"86","author":[{"given":"L.","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"P.","family":"Martins","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"325880_CR1","first-page":"9","volume":"1","author":"A. Amberg","year":"1996","unstructured":"A. Amberg, W. Domschke and S. Voss, Capacitated minimum spanning trees: Algorithms using intelligent search, Combinatorial Optimization: Theory and Practice, vol. 1, 1996, pp. 9-40.","journal-title":"Combinatorial Optimization: Theory and Practice"},{"key":"325880_CR2","unstructured":"G. Araque, L. Hall and T. Magnanti, Capacitated trees, capacitated routing and associated polyhedra, C.O.R.E. Discussion Paper, 1990."},{"key":"325880_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 minimal spanning tree problem, Networks 3(1973)173-182.","journal-title":"Networks"},{"key":"325880_CR4","unstructured":"J. Coimbra and L. Gouveia, Lower bounding and upper bounding methods for a K-cardinality minimal tree problem, paper presented at the 3rd ORSA Telecommunications SIG Conference, Boca Raton, FL, 1995."},{"key":"325880_CR5","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1147\/sj.53.0142","volume":"5","author":"L. Esau","year":"1966","unstructured":"L. Esau and K. Williams, A method for approximating the optimal network, IBM Syst. Journal 5 (1966)142-147.","journal-title":"IBM Syst. Journal"},{"key":"325880_CR6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.37.2.319","volume":"37","author":"M. Fischetti","year":"1989","unstructured":"M. Fischetti and P. Toth, An additive bounding procedure for combinatorial optimization problems, Operations Research 37(1989)319-328.","journal-title":"Operations Research"},{"key":"325880_CR7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/net.3230240103","volume":"24","author":"M. Fischetti","year":"1994","unstructured":"M. Fischetti, H. Hamacher, K. J\u00f6rnsten and F. Maffioli, Weighted K-cardinality trees: Complexity and polyhedral structure, Networks 24(1994)11-21.","journal-title":"Networks"},{"key":"325880_CR8","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"B. Gavish","year":"1982","unstructured":"B. Gavish, Topological design of centralized computer networks: Formulations and algorithms, Networks 12(1982)355-377.","journal-title":"Networks"},{"key":"325880_CR9","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-132.","journal-title":"J. ACM"},{"key":"325880_CR10","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. on Comm. COM-33(1985)1247-1257.","journal-title":"IEEE Trans. on Comm."},{"key":"325880_CR11","unstructured":"B. Gavish and K. Altinkemer, Parallel savings heuristics for the topological design of local access tree networks, in: Proceedings of the IEEE INFOCOM 86 Conference, 1986."},{"key":"325880_CR12","doi-asserted-by":"crossref","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 and Modeling 1(1993)51-76.","journal-title":"Telecommunications Systems and Modeling"},{"key":"325880_CR13","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, Operations Research 43(1995)130-141.","journal-title":"Operations Research"},{"key":"325880_CR14","unstructured":"L. Gouveia and J. Paix\u00e3o, Uma relaxa\u00e7\u00e3o de espa\u00e7o de estados para o problema da \u00e1rvore de suporte de custo m\u00ednimo com restri\u00e7\u00f5es de capacidade, in: Proceedings of the 1\na\nConfer\u00eancia em Estat\u00edstica e Investiga\u00e7\u00e3o Operacional, Troia, Portugal 1990 (in Portuguese)."},{"key":"325880_CR15","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, Annals of Operations Research 33(1991)305-327.","journal-title":"Annals of Operations Research"},{"key":"325880_CR16","unstructured":"L. Gouveia, A. Lucena and J. Paix\u00e3o, A set-partitioning approach for the capacitated minimal spanning tree problem, Paper presented at the 1st ORSA Telecommunications SIG Conference, Boca Raton, FL, 1990."},{"key":"325880_CR17","unstructured":"L. Gouveia and P. Martins, An extended flow based formulation for the capacitated minimal spanning tree problem, Paper presented at the 3rd ORSA Telecommunications SIG Conference, Boca Raton, FL, 1995."},{"key":"325880_CR18","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1287\/moor.17.2.398","volume":"17","author":"L. Hall","year":"1992","unstructured":"L. Hall and T. Magnanti, A polyhedral intersection theorem for capacitated trees, Mathematics of Operations Research 17(1992)398-410.","journal-title":"Mathematics of Operations Research"},{"key":"325880_CR19","unstructured":"L. Hall, Integer programming formulations for designing a centralized processing network, Working Paper, Dept. of Mathematical Sciences, Johns Hopkins University, 1993."},{"key":"325880_CR20","doi-asserted-by":"crossref","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 Journal on Computing 8(1996)219-234.","journal-title":"INFORMS Journal on Computing"},{"key":"325880_CR21","doi-asserted-by":"crossref","unstructured":"T. Magnanti and L. Wolsey, Optimal trees, in: Network Models, Handbooks in Operations Research and Management Science, vol. 7, 1995, pp. 503-615.","DOI":"10.1016\/S0927-0507(05)80126-4"},{"key":"325880_CR22","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1002\/net.3230230603","volume":"23","author":"K. Malik","year":"1993","unstructured":"K. Malik and G. Yu, A branch and bound algorithm for the capacitated minimum spanning tree problem, Networks 23(1993)525-532.","journal-title":"Networks"},{"key":"325880_CR23","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-230.","journal-title":"Networks"},{"key":"325880_CR24","unstructured":"Y. Sharaiha, M. Gendreau, G. Laporte and I. Osman, A tabu search algorithm for the capacitated shortest spanning tree problem, 1995, to appear in Networks."},{"key":"325880_CR25","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02098285","volume":"61","author":"P. Toth","year":"1995","unstructured":"P. Toth and D. Vigo, An exact algorithm for the capacitated shortest spanning arborescence, Annals of Operations Research 61(1995)121-141.","journal-title":"Annals of Operations Research"},{"key":"325880_CR26","unstructured":"N. Zhang, Facet-defining inequalities for capacitated spanning trees, Master Thesis Dissertation, Princeton University, 1993."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018911003529.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018911003529\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018911003529.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:47:20Z","timestamp":1747547240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018911003529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":26,"journal-issue":{"issue":"0","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["325880"],"URL":"https:\/\/doi.org\/10.1023\/a:1018911003529","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}