{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:22Z","timestamp":1774449082694,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,10,19]],"date-time":"2010-10-19T00:00:00Z","timestamp":1287446400000},"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":[[2010,12]]},"DOI":"10.1007\/s10479-010-0800-4","type":"journal-article","created":{"date-parts":[[2010,10,18]],"date-time":"2010-10-18T12:28:11Z","timestamp":1287404891000},"page":"661-681","source":"Crossref","is-referenced-by-count":19,"title":["RAMP for the capacitated minimum spanning tree problem"],"prefix":"10.1007","volume":"181","author":[{"given":"Cesar","family":"Rego","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Mathew","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,19]]},"reference":[{"key":"800_CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"R. K. Ahuja","year":"2001","unstructured":"Ahuja, R. K., Orlin, J. B., & Sharma, D. (2001). Multi-exchange neighborhood search structures for the capacitated minimum spanning tree problem. Mathematical Programming, 91, 71\u201397.","journal-title":"Mathematical Programming"},{"key":"800_CR2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-6377(02)00236-5","volume":"31","author":"R. K. Ahuja","year":"2003","unstructured":"Ahuja, R. K., Orlin, J. B., & Sharma, D. (2003). A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Operations Research Letters, 31, 185\u2013194.","journal-title":"Operations Research Letters"},{"key":"800_CR3","first-page":"9","volume":"1","author":"A. Amberg","year":"1996","unstructured":"Amberg, A., Domschke, W., & Vo\u00df, S. (1996). Capacitated minimum spanning trees: algorithms using intelligent search. Combinatorial Optimization: Theory and Practice, 1, 9\u201339.","journal-title":"Combinatorial Optimization: Theory and Practice"},{"key":"800_CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-0-387-71921-4_3","volume-title":"Metaheuristics: progress in complex systems optimization","author":"M. Caserta","year":"2007","unstructured":"Caserta, M. (2007). Tabu search-based metaheuristic algorithm for large-scale set covering problems. In K.\u00a0F.\u00a0Doerner, M. Gendreau, P. Greistorfer, W. J. Gutjar, R. F. Hartl, & M. Reimann (Eds.), Metaheuristics: progress in complex systems optimization (pp. 43\u201363). Berlin: Springer."},{"key":"800_CR5","doi-asserted-by":"crossref","first-page":"1753","DOI":"10.1109\/TCOM.1974.1092122","volume":"22","author":"D. Elias","year":"1974","unstructured":"Elias, D., & Ferguson, M. J. (1974). Topological design of multipoint teleprocessing networks. IEEE Transactions on Communications, 22, 1753\u20131762.","journal-title":"IEEE Transactions on Communications"},{"key":"800_CR6","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1147\/sj.53.0142","volume":"5","author":"L. R. Esau","year":"1966","unstructured":"Esau, L. R., & Williams, K. C. (1966). On teleprocessing system design. Part II. A method for approximating the optimal network. IBM Systems Journal, 5, 142\u2013147.","journal-title":"IBM Systems Journal"},{"key":"800_CR7","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman."},{"key":"800_CR8","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"B. Gavish","year":"1982","unstructured":"Gavish, B. (1982). Topological design of centralized computer networks: formulations and algorithms. Networks, 12, 355\u2013377.","journal-title":"Networks"},{"issue":"1","key":"800_CR9","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322358.322367","volume":"30","author":"B. Gavish","year":"1983","unstructured":"Gavish, B. (1983). Formulations and algorithms for the capacitated minimal directed spanning tree problem. Journal of ACM, 30(1), 118\u2013132.","journal-title":"Journal of ACM"},{"key":"800_CR10","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TCOM.1985.1096250","volume":"12","author":"B. Gavish","year":"1985","unstructured":"Gavish, B. (1985). Augmented Lagrangian based algorithms for centralized network design. IEEE Transactions on Communications, COM-33, 12, 1247\u20131257.","journal-title":"IEEE Transactions on Communications, COM-33"},{"key":"800_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02061657","volume":"33","author":"B. Gavish","year":"1991","unstructured":"Gavish, B. (1991). Topological design telecommunications networks: local access design methods. Annals of Operations Research, 33, 17\u201371.","journal-title":"Annals of Operations Research"},{"key":"800_CR12","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989a). Tabu search. Part I. ORSA Journal on Computing, 1, 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"800_CR13","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989b). Tabu search. Part II. ORSA Journal on Computing, 2, 4\u201332.","journal-title":"ORSA Journal on Computing"},{"key":"800_CR14","first-page":"1","volume-title":"Interfaces in computer science and operations research","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996). Tabu search and adaptive memory programming: advances, applications and challenges. In R. Barr, R. Helgason, & J. Kennington (Eds.), Interfaces in computer science and operations research (pp. 1\u201375). Norwell: Kluwer Academic."},{"key":"800_CR15","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/0-387-23667-8_19","volume-title":"Metaheuristic optimization via memory and evolution","author":"F. Glover","year":"2005","unstructured":"Glover, F. (2005). Adaptive memory projection methods for integer programming. In C.\u00a0Rego, & B. Alidaee (Eds.), Metaheuristic optimization via memory and evolution (pp. 425\u2013440). Norwell: Kluwer Academic."},{"issue":"4","key":"800_CR16","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0305-0548(86)90050-X","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F., & McMillan, C. (1986). The general employee scheduling problem: an integration of management science and artificial intelligence. Computers and Operations Research, 13(4), 563\u2013593.","journal-title":"Computers and Operations Research"},{"key":"800_CR17","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.43.1.130","volume":"43","author":"L. Gouveia","year":"1995","unstructured":"Gouveia, L. (1995). A 2n constraint formulation for the capacitated minimal spanning tree problem. Operations Research, 43, 130\u2013141.","journal-title":"Operations Research"},{"key":"800_CR18","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/978-1-4615-1507-4_17","volume-title":"Essays and surveys in metaheuristics","author":"T. Gr\u00fcnert","year":"2002","unstructured":"Gr\u00fcnert, T. (2002). Lagrangian tabu search. In C. C. Ribeiro & P. Hansen (Eds.), Essays and surveys in metaheuristics (pp. 379\u2013397). Norwell: Kluwer Academic."},{"key":"800_CR19","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/ijoc.8.3.219","volume":"8","author":"L. A. Hall","year":"1996","unstructured":"Hall, L. A. (1996). Experience with a cutting plane approach for the capacitated spanning tree problem. ORSA Journal on Computing, 8, 219\u2013234.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"800_CR20","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.32.1.52","volume":"32","author":"M. H. Karwan","year":"1984","unstructured":"Karwan, M. H., & Rardin, R. L. (1984). Surrogate dual multiplier search procedures in integer programming. Operations Research, 32(1), 52\u201369.","journal-title":"Operations Research"},{"issue":"12","key":"800_CR21","first-page":"1145","volume":"25","author":"J. G. Klincewicz","year":"1998","unstructured":"Klincewicz, J. G., Luss, H., & Yan, D. C. K. (1998). Designing tributary networks with multiple ring families. Computers. Operations Research, 25(12), 1145\u20131157.","journal-title":"Operations Research"},{"key":"800_CR22","first-page":"325","volume":"123","author":"L. A. N. Lorena","year":"1999","unstructured":"Lorena, L. A. N., & Narciso, M. G. (1999). Lagrangian\/surrogate relaxation for generalized assignment problems. European Journal of Operational Research, 123, 325\u2013332.","journal-title":"European Journal of Operational Research"},{"key":"800_CR23","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1002\/net.3230230603","volume":"23","author":"K. Malik","year":"1993","unstructured":"Malik, K., & Yu, G. (1993). A branch and bound algorithm for the capacitated minimum spanning tree problem. Networks, 23, 525\u2013532.","journal-title":"Networks"},{"key":"800_CR24","first-page":"31021","volume-title":"Proceedings of the Decision Sciences Institute (DSI)","author":"F. Mathew","year":"2006","unstructured":"Mathew, F., & Rego, C., (2006). Recent advances in heuristics for the capacitated minimum spanning tree problem. In Proceedings of the Decision Sciences Institute (DSI), San Antonio, TX (pp. 31021\u201331026)."},{"issue":"6","key":"800_CR25","doi-asserted-by":"crossref","first-page":"449","DOI":"10.26421\/QIC5.6-3","volume":"5","author":"R. Or\u00fas","year":"2005","unstructured":"Or\u00fas, R. (2005). Two slightly-entangled NP-complete problems. Quantum Information and Computation, 5(6), 449\u2013455.","journal-title":"Quantum Information and Computation"},{"key":"800_CR26","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230080306","volume":"8","author":"C. Papadimitriou","year":"1978","unstructured":"Papadimitriou, C. (1978). The complexity of the capacitated tree problem. Networks, 8, 217\u2013230.","journal-title":"Networks"},{"key":"800_CR27","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1009629727566","volume":"5","author":"R. Patterson","year":"1999","unstructured":"Patterson, R., Pirkul, H., & Rolland, E. (1999). Memory adaptive reasoning for solving the capacitated minimum spanning tree problem. Journal of Heuristics, 5, 159\u2013180.","journal-title":"Journal of Heuristics"},{"key":"800_CR28","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"B. T. Polyak","year":"1969","unstructured":"Polyak, B. T. (1969). Minimization of unsmooth functionals. USSR Computational Mathematics and Mathematical Physics, 9, 14\u201329.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"800_CR29","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/0-387-23667-8_20","volume-title":"Metaheuristic optimization via memory and evolution: tabu search and scatter search","author":"C. Rego","year":"2005","unstructured":"Rego, C. (2005). RAMP: A new metaheuristic framework for combinatorial optimization. In C. Rego & B. Alidaee (Eds.), Metaheuristic optimization via memory and evolution: tabu search and scatter search (pp. 441\u2013460). Norwell: Kluwer Academic."},{"key":"800_CR30","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<161::AID-NET4>3.0.CO;2-F","volume":"29","author":"Y. M. Sharaiha","year":"1997","unstructured":"Sharaiha, Y. M., Gendreau, M., Laporte, G., & Osman, I. H. (1997). A tabu search algorithm for the capacitated shortest spanning tree problem. Networks, 29, 161\u2013171.","journal-title":"Networks"},{"issue":"2","key":"800_CR31","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10107-006-0043-y","volume":"112","author":"E. Uchoa","year":"2008","unstructured":"Uchoa, E., Fukasawa, R., Lysgaard, J., Pessoa, A., de Arag\u00e3o, M. P., & Andrade, D. (2008). Robust branch-but-and-price for the capacitated minimum spanning tree problem over a large extended formulation. Mathematical Programming, Series A, 112(2), 443\u2013472.","journal-title":"Mathematical Programming, Series A"},{"key":"800_CR32","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.ejor.2004.10.018","volume":"172","author":"M. Yagiura","year":"2006","unstructured":"Yagiura, M., Kishida, M., & Ibaraki, T. (2006). A 3-flip neighborhood local search for the set covering problem. European Journal of Operational Research, 172, 472\u2013499.","journal-title":"European Journal of Operational Research"},{"key":"800_CR33","unstructured":"Zhang, N. (1993). Facet-defining inequalities for minimum spanning trees. Master thesis, Princeton University, Princeton, New Jersey"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0800-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0800-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0800-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T01:25:54Z","timestamp":1636680354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0800-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,19]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["800"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0800-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,19]]}}}