{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T10:22:22Z","timestamp":1781173342693,"version":"3.54.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,9,4]],"date-time":"2014-09-04T00:00:00Z","timestamp":1409788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10479-014-1693-4","type":"journal-article","created":{"date-parts":[[2014,9,2]],"date-time":"2014-09-02T22:56:25Z","timestamp":1409698585000},"page":"141-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Making a state-of-the-art heuristic faster with data mining"],"prefix":"10.1007","volume":"263","author":[{"given":"Daniel","family":"Martins","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriel M.","family":"Vianna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Isabel","family":"Rosseti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simone L.","family":"Martins","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandre","family":"Plastino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,9,4]]},"reference":[{"key":"1693_CR1","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the very large data bases conference (pp. 487\u2013499)."},{"key":"1693_CR2","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"4","author":"R Aiex","year":"2007","unstructured":"Aiex, R., Resende, M. G. C., & Ribeiro, C. (2007). TTT plots: A perl program to create time-to-target plots. Optimization Letters, 4, 355\u2013366.","journal-title":"Optimization Letters"},{"key":"1693_CR3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10732-010-9130-6","volume":"17","author":"D Aloise","year":"2011","unstructured":"Aloise, D., & Ribeiro, C. C. (2011). Adaptive memory in multistart heuristics for multicommodity network design. Journal of Heuristics, 17, 153\u2013179.","journal-title":"Journal of Heuristics"},{"key":"1693_CR4","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","volume":"21","author":"JE Beasley","year":"1985","unstructured":"Beasley, J. E. (1985). A note on solving large p-median problems. European Journal of Operational Research, 21, 270\u2013273.","journal-title":"European Journal of Operational Research"},{"key":"1693_CR5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1009679511137","volume":"6","author":"D Berger","year":"2000","unstructured":"Berger, D., Gendron, B., Potvin, J.-Y., Raghavan, S., & Soriano, P. (2000). Tabu search for a network loading problem with multiple facilities. Journal of Heuristics, 6, 253\u2013267.","journal-title":"Journal of Heuristics"},{"key":"1693_CR6","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G Cornu\u00e9jols","year":"1977","unstructured":"Cornu\u00e9jols, G., Fisher, M. L., & Nemhauser, G. L. (1977). Location of bank accounts to optimize float: An analytical study of exact and approximate algorithms. Management Science, 23, 789\u2013810.","journal-title":"Management Science"},{"key":"1693_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00663.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa, P., & Resende, M. G. C. (2009a). An annotated bibliography of GRASP\u2014Part I: Algorithms. International Transactions in Operational Research, 16, 1\u201324.","journal-title":"International Transactions in Operational Research"},{"key":"1693_CR8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.1475-3995.2009.00664.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa, P., & Resende, M. G. C. (2009b). An annotated bibliography of GRASP\u2014Part II: Applications. International Transactions in Operational Research, 16, 131\u2013172.","journal-title":"International Transactions in Operational Research"},{"key":"1693_CR9","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. (1999). Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS Journal on Computing, 2, 198\u2013204.","journal-title":"INFORMS Journal on Computing"},{"key":"1693_CR10","doi-asserted-by":"crossref","unstructured":"Gendreau, M., & Potvin, J.-Y. (2010). Handbook of metaheuristics. New York: Springer.","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"1693_CR11","unstructured":"Glover, F. (1992). New ejection chain and alternating path methods for traveling salesman problems, computer science and operations research. In O. Balci, R. Sharda, & S. Zenios (Eds.), New developments and their interfaces (pp. 449\u2013509). Pergamon Press."},{"key":"1693_CR12","unstructured":"Glover, F. (2000). Multi-start and strategic oscillation methods\u2014Principles to exploit adaptive memory, computing tools for modeling, optimization and simulation: Interfaces in computer science and operations research. US: Springer."},{"key":"1693_CR13","first-page":"653","volume":"19","author":"F Glover","year":"1977","unstructured":"Glover, F., Laguna, M., & Mart\u00ed, R. (1977). Fundamentals of scatter search and path-relinking. Control and Cybernetics, 19, 653\u2013684.","journal-title":"Control and Cybernetics"},{"key":"1693_CR14","unstructured":"Glover, F., Laguna, M., & Mart\u00ed, R. (2003). Scatter search and path relinking: Advances and applications. Handbook of Metaheuristics. US: Springer."},{"key":"1693_CR15","unstructured":"Goethals, B., & Zaki, M. J. (2003). Advances in frequent itemset mining implementations: Introduction to FIMI-03. In Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations."},{"key":"1693_CR16","unstructured":"Grahne, G., & Zhu, J. (2003). Efficiently using prefix-trees in mining frequent item-sets. In Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations."},{"key":"1693_CR17","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD international conference on management of data (pp. 1\u201312).","DOI":"10.1145\/342009.335372"},{"key":"1693_CR18","unstructured":"Han, J., & Kamber, M. (2011). Data mining: Concepts and techniques (3rd ed.). San Francisco: Morgan Kaufmann Publishers."},{"key":"1693_CR19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P Hansen","year":"1997","unstructured":"Hansen, P., & Mladenovi\u0107, N. (1997). Variable neighborhood search for the p-median. Location Science, 5, 207\u2013226.","journal-title":"Location Science"},{"key":"1693_CR20","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N., & Perez-Brito, D. (2001). Variable neighborhood decomposition search. Journal of Heuristics, 7, 335\u2013350.","journal-title":"Journal of Heuristics"},{"key":"1693_CR21","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., & Hakimi, L. (1979). An algorithmic approach to network location problems, part II: The p-medians. SIAM Journal of Applied Mathematics, 37, 539\u2013560.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"1693_CR22","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. W. (1973). An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21, 498\u2013516.","journal-title":"Operations Research"},{"key":"1693_CR23","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. (1999). An evolutionary heuristic for quadratic 0\u20131 programming. European Journal of Operational Research, 119, 662\u2013670.","journal-title":"European Journal of Operational Research"},{"key":"1693_CR24","doi-asserted-by":"crossref","unstructured":"Orlando, S., Palmerimi, P., & Perego, R. (2002). Adaptive and resource-aware mining of frequent sets. In Proceedings of the IEEE international conference on data mining (pp. 338\u2013345).","DOI":"10.1109\/ICDM.2002.1183921"},{"key":"1693_CR25","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF02125421","volume":"63","author":"I Osman","year":"1996","unstructured":"Osman, I., & Laporte, G. (1996). Metaheuristics: A bibliography. Annals of Operations Research, 63, 513\u2013623.","journal-title":"Annals of Operations Research"},{"key":"1693_CR26","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1080\/01621459.1971.10482319","volume":"66","author":"MR Rao","year":"1971","unstructured":"Rao, M. R. (1971). Cluster analysis and mathematical programming. Journal of the American Statistical Association, 66, 622\u2013626.","journal-title":"Journal of the American Statistical Association"},{"key":"1693_CR27","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G. (1991). TSPLIB: A traveling salesman problem library. ORSA Journal on Computing, 3, 376\u2013384.","journal-title":"ORSA Journal on Computing"},{"key":"1693_CR28","unstructured":"Resende, M. G. C., & Ribeiro, C. C. (2013). Greedy randomized adaptive search procedures. In E. K. Burke & G. Kendall (Eds.), Search methodologies (2nd ed., pp. 285\u2013310). US: Springer."},{"key":"1693_CR29","unstructured":"Resende, M. G. C. & Werneck, R. F. (2003). On the implementation of a swap-based local search procedure for the \n                        $$p$$\n                        \n                            \n                                p\n                            \n                        \n                    -median problem. In Proceedings of the fifth workshop on algorithm engineering and experiments\u2014ALENEX03 (pp. 119\u2013127)."},{"key":"1693_CR30","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"MGC Resende","year":"2004","unstructured":"Resende, M. G. C., & Werneck, R. F. (2004). A hybrid heuristic for the p-median problem. Journal of Heuristics, 10, 59\u201388.","journal-title":"Journal of Heuristics"},{"key":"1693_CR31","unstructured":"Ribeiro, M. H. F., Trindade, V. F., Plastino, A., & Martins, S. L. (2004). Hybridization of GRASP metaheuristic with data mining techniques. In Proceedings of the ECAI workshop on hybrid metaheuristics (pp. 69\u201378)."},{"key":"1693_CR32","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10852-005-9030-1","volume":"5","author":"MHF Ribeiro","year":"2006","unstructured":"Ribeiro, M. H. F., Trindade, V. F., Plastino, A., & Martins, S. L. (2006). Hybridization of GRASP metaheuristic with data mining techniques. Journal of Mathematical Modeling and Algorithms, 5, 23\u201341.","journal-title":"Journal of Mathematical Modeling and Algorithms"},{"key":"1693_CR33","unstructured":"Salhi, S. (2006). Heuristic search: The science of tomorrow. In British operational research conference (OR48) Keynote Papers, Operational Research Society (pp. 38\u201358)."},{"key":"1693_CR34","doi-asserted-by":"crossref","unstructured":"Santos, L. F., Ribeiro, M. H. F., Plastino, A., & Martins, S. L. (2005). A hybrid GRASP with data mining for the maximum diversity problem. In Proceedings of the international workshop on hybrid metaheuristics, LNCS, 3636 (pp. 116\u2013127).","DOI":"10.1007\/11546245_11"},{"key":"1693_CR35","doi-asserted-by":"crossref","unstructured":"Santos, L. F., Albuquerque, C. V., Martins, S. L., & Plastino, A. (2006). A hybrid GRASP with data mining for efficient server replication for reliable multicast. In Proceedings of the IEEE GLOBECOM conference.","DOI":"10.1109\/GLOCOM.2006.246"},{"key":"1693_CR36","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. (2008). Applications of the DM-GRASP heuristic: A survey. International Transactions in Operational Research, 15, 387\u2013416.","journal-title":"International Transactions in Operational Research"},{"key":"1693_CR37","unstructured":"Senne, E. L. F., & Lorena, L. A. N. (2000). Langrangean\/Surrogate Heuristics for p-Median Problems. In M. Laguna & J. L. Gonz\u00e1lez-Velarde (Eds.), Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research (pp. 115\u2013130). Boston: Kluwer Academic."},{"key":"1693_CR38","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1021841728075","volume":"9","author":"ED Taillard","year":"2003","unstructured":"Taillard, E. D. (2003). Heuristic methods for large centroid clustering problems. Journal of Heuristics, 9, 51\u201374.","journal-title":"Journal of Heuristics"},{"key":"1693_CR39","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"EG Talbi","year":"2002","unstructured":"Talbi, E. G. (2002). A taxonomy of hybrid metaheuristics. Journal of Heuristics, 8, 541\u2013564.","journal-title":"Journal of Heuristics"},{"key":"1693_CR40","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1287\/mnsc.29.4.482","volume":"29","author":"BC Tansel","year":"1983","unstructured":"Tansel, B. C., Francis, R. L., & Lowe, T. J. (1983). Location on networks: A survey. Management Science, 29, 482\u2013511.","journal-title":"Management Science"},{"key":"1693_CR41","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"MB Teitz","year":"1968","unstructured":"Teitz, M. B., & Bart, P. (1968). Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16, 955\u2013961.","journal-title":"Operations Research"},{"key":"1693_CR42","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1080\/01621459.1969.10500990","volume":"64","author":"HD Vinod","year":"1969","unstructured":"Vinod, H. D. (1969). Integer programming and the theory of groups. Journal of the American Statistical Association, 64, 506\u2013519.","journal-title":"Journal of the American Statistical Association"},{"key":"1693_CR43","first-page":"95","volume":"21","author":"R Whitaker","year":"1983","unstructured":"Whitaker, R. (1983). A fast algorithm for the greedy interchange of large-scale clustering and median location problems. INFOR, 21, 95\u2013108.","journal-title":"INFOR"},{"key":"1693_CR44","unstructured":"Witten, I. H., & Frank, E. (2011). Data mining: Practical machine learning tools and techniques (3rd ed.). San Francisco: Morgan Kaufmann Publishers."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1693-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1693-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1693-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1693-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:52Z","timestamp":1559138992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1693-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,4]]},"references-count":44,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["1693"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1693-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,4]]}}}