{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:20:05Z","timestamp":1745986805533,"version":"3.40.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,1,18]],"date-time":"2013-01-18T00:00:00Z","timestamp":1358467200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s11590-013-0607-8","type":"journal-article","created":{"date-parts":[[2013,1,17]],"date-time":"2013-01-17T05:46:13Z","timestamp":1358401573000},"page":"435-446","source":"Crossref","is-referenced-by-count":0,"title":["Heuristics for the multi-level capacitated minimum spanning tree problem"],"prefix":"10.1007","volume":"8","author":[{"given":"Christos A.","family":"Pappas","sequence":"first","affiliation":[]},{"given":"Angelos-Christos G.","family":"Anadiotis","sequence":"additional","affiliation":[]},{"given":"Chrysa A.","family":"Papagianni","sequence":"additional","affiliation":[]},{"given":"Iakovos S.","family":"Venieris","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,18]]},"reference":[{"key":"607_CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"RK Ahuja","year":"2001","unstructured":"Ahuja, R.K., Orlin, J.B., Sharma, D.: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Progr. 91, 71\u201397 (2001)","journal-title":"Math. Progr."},{"key":"607_CR2","doi-asserted-by":"crossref","unstructured":"Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and zipf-like distributions: evidence and implications. In: INFOCOM9, vol. 1, pp. 126\u2013134 (1999)","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"607_CR3","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1147\/sj.53.0142","volume":"5","author":"LR Esau","year":"1966","unstructured":"Esau, L.R., Williams, K.C.: On teleprocessing system design: part ii a method for approximating the optimal network. IBM Syst. J. 5, 142\u2013147 (1966)","journal-title":"IBM Syst. J."},{"key":"607_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2, 5\u201330 (1996)","journal-title":"J. Heuristics"},{"issue":"3","key":"607_CR5","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1287\/ijoc.1040.0123","volume":"18","author":"I Gamvros","year":"2006","unstructured":"Gamvros, I., Golden, B., Raghavan, S.: The multilevel capacitated minimum spanning tree problem. INFORMS J. Comput. 18(3), 348\u2013365 (2006)","journal-title":"INFORMS J. Comput."},{"key":"607_CR6","doi-asserted-by":"crossref","unstructured":"Gamvros, I., Raghavan, S., Golden, B.: An evolutionary approach for the multi-level capacitated minimum spanning tree. Institute for Systems Research, University of Maryland, Technical Report (2002)","DOI":"10.1007\/978-1-4757-3762-2_6"},{"key":"607_CR7","doi-asserted-by":"crossref","unstructured":"Gavish, B.: Topological design of centralized computer networks\u2014formulations and algorithms. Networks 12, 355\u2013377 (1982)","DOI":"10.1002\/net.3230120402"},{"key":"607_CR8","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322358.322367","volume":"30","author":"B Gavish","year":"1983","unstructured":"Gavish, B.: Formulations and algorithms for the capacitated minimal directed tree problem. J. ACM 30, 118\u2013132 (1983)","journal-title":"J. ACM"},{"key":"607_CR9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF02136155","volume":"1","author":"L Gouveia","year":"1993","unstructured":"Gouveia, L.: A comparison of directed formulations for the capacitated minimal spanning tree problem. Telecommun. Syst. 1, 51\u201376 (1993)","journal-title":"Telecommun. Syst."},{"key":"607_CR10","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.43.1.130","volume":"43","author":"L Gouveia","year":"1995","unstructured":"Gouveia, L.: A 2n constraint formulation for the capacitated minimal spanning tree problem. Oper. Res. 43, 130\u2013141 (1995)","journal-title":"Oper. Res."},{"key":"607_CR11","unstructured":"IBM Corp.: ILOG CPLEX V12.1-User\u2019s Manual for CPLEX. url: ftp:\/\/public.dhe.ibm.com\/software\/websphere\/ilog\/docs\/optimization\/cplex\/ps_usrmancplex.pdf"},{"key":"607_CR12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10732-008-9079-x","volume":"15","author":"AX Martins","year":"2009","unstructured":"Martins, A.X., Souza, M.C., Souza, M.J., Toffolo, T.A.: Grasp with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem. J. Heuristics 15, 133\u2013151 (2009)","journal-title":"J. Heuristics"},{"key":"607_CR13","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230080306","volume":"8","author":"C Papadimitriou","year":"1978","unstructured":"Papadimitriou, C.: The complexity of the capacitated tree problem. Networks 8, 217\u2013230 (1978)","journal-title":"Networks"},{"key":"607_CR14","doi-asserted-by":"crossref","unstructured":"Papagianni, C., Pappas, C., Lefkaditis, N., Venieris, I.: Particle swarm optimization for the multi level capacitated minimum spanning tree. In: IMCSIT, pp. 765\u2013770 (2009)","DOI":"10.1109\/IMCSIT.2009.5352755"},{"key":"607_CR15","unstructured":"Uchoa, E., Toffolo, T.A.M., de Souza, M.C., Martins, A.X.: Branch-and-cut and grasp with hybrid local search for the multi-level capacitated minimum spanning tree problem. In: INOC 2009. Pisa, Italy (2009)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0607-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-013-0607-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0607-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T17:23:46Z","timestamp":1745947426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-013-0607-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,18]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["607"],"URL":"https:\/\/doi.org\/10.1007\/s11590-013-0607-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2013,1,18]]}}}