{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T14:35:54Z","timestamp":1780929354107,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,8,9]],"date-time":"2013-08-09T00:00:00Z","timestamp":1376006400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10732-013-9231-0","type":"journal-article","created":{"date-parts":[[2013,8,8]],"date-time":"2013-08-08T05:42:30Z","timestamp":1375940550000},"page":"39-74","source":"Crossref","is-referenced-by-count":25,"title":["Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic"],"prefix":"10.1007","volume":"20","author":[{"given":"Alexandre","family":"Plastino","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hugo","family":"Barbalho","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luis Filipe M.","family":"Santos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard","family":"Fuchshuber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simone L.","family":"Martins","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,8,9]]},"reference":[{"issue":"4","key":"9231_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"R Aiex","year":"2007","unstructured":"Aiex, R., Resende, M.G.C., Ribeiro, C.: TTT plots: A perl program to create time-to-target plots. Optim. Lett. 1(4), 355\u2013366 (2007)","journal-title":"Optim. Lett."},{"key":"9231_CR2","doi-asserted-by":"crossref","unstructured":"Aloise, D., Ribeiro, C.: Adaptive memory in multistart heuristics for multicommodity network design. J. Heuristics 17, 153\u2013179 (2011)","DOI":"10.1007\/s10732-010-9130-6"},{"issue":"3","key":"9231_CR3","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. 35(3), 268\u2013308 (2003). doi: 10.1145\/937503.937505","journal-title":"ACM Comput. Surv."},{"key":"9231_CR4","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/35.587723","volume":"35","author":"KL Calvert","year":"1997","unstructured":"Calvert, K.L., Doar, M.B., Nexion, A., Zegura, E.W.: Modeling internet topology. IEEE Commun. Mag. 35, 160\u2013163 (1997)","journal-title":"IEEE Commun. Mag."},{"key":"9231_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"key":"9231_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"9231_CR7","doi-asserted-by":"crossref","unstructured":"Festa, P., Resende, M.G.C.: GRASP: An annotated bibliography. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys on Metaheuristics, pp. 325\u2013367. Kluwer Academic Publishers, Norwell (2002)","DOI":"10.1007\/978-1-4615-1507-4_15"},{"key":"9231_CR8","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"2","author":"C Fleurent","year":"1999","unstructured":"Fleurent, C., Glover, F.: Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J. Comput. 2, 198\u2013204 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9231_CR9","first-page":"653","volume":"19","author":"F Glover","year":"1977","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path-relinking. Control Cybern. 19, 653\u2013684 (1977)","journal-title":"Control Cybern."},{"key":"9231_CR10","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Scatter search and path relinking: Advances and applications. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 1\u201335. Kluwer Academic Publishers, Norwell (2003)","DOI":"10.1007\/0-306-48056-5_1"},{"key":"9231_CR11","unstructured":"Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (2003)"},{"key":"9231_CR12","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"2006","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann, Burlington (2006)","edition":"2"},{"issue":"3","key":"9231_CR13","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. ii: The p-medians. SIAM J. Appl. Math. 37(3), 513\u2013538 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"9231_CR14","unstructured":"Kasera, S.K., Kurose, J., Towsley, D.: A comparison of server-based and receiver-based local recovery approaches for scalable reliable multicast. In: Proceedings of INFOCOM\u201998, pp 988\u2013995 (1998)"},{"key":"9231_CR15","unstructured":"Li, B., Chen, F., Yin, L.: Server replication and its placement for reliable multicast. In: Proceedings of the 9th International Conference on Computer Communication and Networks, pp 396\u2013401 (2000)"},{"key":"9231_CR16","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"9231_CR17","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/S0377-2217(98)00359-2","volume":"119","author":"A Lodi","year":"1999","unstructured":"Lodi, A., Allemand, K., Liebling, T.M.: An evolutionary heuristic for quadratic 0\u20131 programming. Eur. J. Oper. Res. 119, 662\u2013670 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"9231_CR18","unstructured":"Nonnenmacher, J., Lacher, M., Jung, M., Biersack EW, Carle, G.: How bad is reliable multicast without local recovery? In: Proceedings of INFOCOM \u201998, pp 972\u2013979, (1998)"},{"key":"9231_CR19","doi-asserted-by":"crossref","unstructured":"Plastino, A., Fonseca, E.R., Fuchshuber, R., Martins, S.L., Freitas, A.A., Luis, M., Salhi, S.: A hybrid data mining metaheuristic for the p-median problem. In: Proceedings of the SIAM International Conference on Data Mining (2009)","DOI":"10.1137\/1.9781611972795.27"},{"key":"9231_CR20","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M Prais","year":"2000","unstructured":"Prais, M., Ribeiro, C.: Reactive grasp: An application to a matrix decomposition problem in tdma traffic assignment. INFORMS J. Comput. 12, 164\u2013176 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9231_CR21","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of Metaheuristics","author":"MGC Resende","year":"2003","unstructured":"Resende, M.G.C., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 219\u2013249. Springer, Berlin (2003)"},{"key":"9231_CR22","doi-asserted-by":"crossref","unstructured":"Ribeiro, C.C., Rosseti, I., Vallejos, R.: On the use of run time distributions to evaluate and compare stochastic local search algorithms. In: Proceedings of the Engineering Stochastic Local Search Algorithms Workshop. Lecture Notes in Computer Science 5752, 16\u201330 (2009)","DOI":"10.1007\/978-3-642-03751-1_2"},{"issue":"1","key":"9231_CR23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10852-005-9030-1","volume":"5","author":"M Ribeiro","year":"2006","unstructured":"Ribeiro, M., Plastino, A., Martins, S.L.: Hybridization of GRASP metaheuristic with data mining techniques. J. Math. Model. Algorithms 5(1), 23\u201341 (2006). doi: 10.1007\/s10852-005-9030-1","journal-title":"J. Math. Model. Algorithms"},{"key":"9231_CR24","unstructured":"Ribeiro, M.H., Trindade, V.A., Plastino, A., Martins, S.L.: Hybridization of GRASP metaheuristics with data mining techniques. In: Proceedings of the International Workshop on Hybrid Metaheuristics, pp. 69\u201378 (2004)"},{"key":"9231_CR25","doi-asserted-by":"crossref","unstructured":"Santos, L.F., Ribeiro, M.H., Plastino, A., Martins, S.L.: A Hybrid GRASP with Data Mining for the Maximum Diversity Problem. In: Proceedings of the International Workshop on Hybrid Metaheuristics, pp. 67\u201378 (2005)","DOI":"10.1007\/11546245_11"},{"key":"9231_CR26","doi-asserted-by":"crossref","unstructured":"Santos, L.F., Milagres, R., Albuquerque, C.V., Martins, S.L., Plastino, A.: A hybrid GRASP with data mining for efficient server replication for reliable multicast. In: Proceedings of the GLOBECOM (2006)","DOI":"10.1109\/GLOCOM.2006.246"},{"key":"9231_CR27","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1111\/j.1475-3995.2008.00644.x","volume":"15","author":"LF Santos","year":"2008","unstructured":"Santos, L.F., Martins, S.L., Plastino, A.: Applications of the DM-GRASP heuristic: A survey. Int. Trans. Oper. Res. 15, 387\u2013416 (2008)","journal-title":"Int. Trans. Oper. Res."},{"issue":"5","key":"9231_CR28","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"EG Talbi","year":"2002","unstructured":"Talbi, E.G.: A taxonomy of hybrid metaheuristics. J. Heuristics 8(5), 541\u2013564 (2002)","journal-title":"J. Heuristics"},{"key":"9231_CR29","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9231-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-013-9231-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9231-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T15:30:10Z","timestamp":1563636610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-013-9231-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,9]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9231"],"URL":"https:\/\/doi.org\/10.1007\/s10732-013-9231-0","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,9]]}}}