{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T16:07:51Z","timestamp":1768406871365,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,12,29]],"date-time":"2005-12-29T00:00:00Z","timestamp":1135814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s10852-005-9030-1","type":"journal-article","created":{"date-parts":[[2005,12,28]],"date-time":"2005-12-28T14:52:07Z","timestamp":1135781527000},"page":"23-41","source":"Crossref","is-referenced-by-count":54,"title":["Hybridization of GRASP Metaheuristic with Data Mining Techniques"],"prefix":"10.1007","volume":"5","author":[{"given":"Marcos Henrique","family":"Ribeiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Plastino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone L.","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,12,29]]},"reference":[{"key":"9030_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T. and Srikant, R.: Mining association rules between sets of items in large databases, in ACM SIGMOD Intl. Conf. on Management of Data, 1993, pp. 207\u2013216.","DOI":"10.1145\/170035.170072"},{"key":"9030_CR2","unstructured":"Agrawal, R. and Srikant, R.: Fast algorithms for mining association rules, in 20th Very Large DataBase Conference, 1994, pp. 487\u2013499."},{"key":"9030_CR3","doi-asserted-by":"crossref","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G. and Lakhal, L.: Mining frequent patterns with counting inference, ACM SIGKDD Explorations Newsletter 2 (2000), 66\u201375.","DOI":"10.1145\/380995.381017"},{"key":"9030_CR4","unstructured":"Berry, M. L. A. and Linoff, G.: Data Mining Techniques: for Marketing, Sales and Customer Support, Wiley Computer, 1997."},{"key":"9030_CR5","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/S0377-2217(03)00263-7","volume":"153","author":"X. Delorme","year":"2003","unstructured":"Delorme, X., Gandibleux, X. and Rodriguez, J.: GRASP for set packing problems, Eur. J. Oper. Res. 153 (2003), 564\u2013580.","journal-title":"Eur. J. Oper. Res."},{"key":"9030_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. A. Feo","year":"1995","unstructured":"Feo, T. A. and Resende, M. G. C.: Greedy randomized adaptive search procedures, J. Glob. Optim. 6 (1995), 109\u2013133.","journal-title":"J. Glob. Optim."},{"key":"9030_CR7","doi-asserted-by":"crossref","unstructured":"Gandibleux, X., Delorme, X. and T\u2019Kindt, V.: An ant colony algorithm for the set packing problem, Note de Recherche, no 13, LAMIH-ROI, Universit\u00e9 de Valeciennes et du Hainaut-Cambr\u00e9sis, 2004.","DOI":"10.1007\/978-3-540-28646-2_5"},{"key":"9030_CR8","unstructured":"Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, V. H. Freeman and Company, 1979."},{"key":"9030_CR9","unstructured":"Guo, Y., Lim, A., Rodrigues, B. and Zhu, Y.: Heuristics for a brokering set packing problem, in 8th Intl. Symposium on Artificial Intelligence and Mathematics, 2004."},{"key":"9030_CR10","doi-asserted-by":"crossref","unstructured":"Goethals, B. and Zaki, M. J.: Advances in frequent itemset mining implementations: introduction to FIMI\u201903, in IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2003.","DOI":"10.1145\/1007730.1007744"},{"key":"9030_CR11","unstructured":"Grahne, G. and Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets, in IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2003."},{"key":"9030_CR12","unstructured":"Han, J. and Kamber, M.: Data Mining: Concepts and Techniques, Morgan Kaufmann, 2000."},{"key":"9030_CR13","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J. and Yin, Y.: Mining frequent patterns without candidate generation, in ACM SIGMOD Intl. Conf. on Management of Data, 2000, pp. 1\u201312.","DOI":"10.1145\/342009.335372"},{"key":"9030_CR14","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. and Liebling, T. M.: An evolutionary heuristic for quadratic 0-1 programming, Eur. J. Oper. Res. 119 (1999), 662\u2013670.","journal-title":"Eur. J. Oper. Res."},{"key":"9030_CR15","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A. Mingozzi","year":"1998","unstructured":"Mingozzi, A., Maniezzo, V., Ricciardelli, S. and Bianco, L.: An exact algorithm for the project scheduling with resource constraints based on a new mathematical formulation, Manag. Sci. 44 (1998), 714\u2013729.","journal-title":"Manag. Sci."},{"key":"9030_CR16","doi-asserted-by":"crossref","unstructured":"Orlando, S., Palmerimi, P. and Perego, R.: Adaptive and resource-aware mining of frequent sets, in IEEE Intl. Conf. on Data Mining, 2002, pp. 338\u2013345.","DOI":"10.1109\/ICDM.2002.1183921"},{"key":"9030_CR17","unstructured":"Orlando, S., Palmerimi, P., Perego, R., Lucchese, C. and Silvestri, F.: kDCI++: A multi\u2013strategy algorithm for discovering frequent sets in large databases, in IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2003."},{"key":"9030_CR18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. W. Padberg","year":"1973","unstructured":"Padberg, M. W.: On the facial structure of set packing polyhedra, Math. Program. 5 (1973), 199\u2013215.","journal-title":"Math. Program."},{"key":"9030_CR19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P. M. Pardalos","year":"1990","unstructured":"Pardalos, P. M. and Rodgers, G. P.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming, Computing 45 (1990), 131\u2013144.","journal-title":"Computing"},{"key":"9030_CR20","doi-asserted-by":"crossref","unstructured":"Park, J. S., Chen, M. and Yu, P. S.: An effective hash-based algorithm for mining association rules, in ACM SIGMOD Intl. Conf. on Management of Data, 1995, pp. 175\u2013186.","DOI":"10.1145\/223784.223813"},{"key":"9030_CR21","unstructured":"Savasere, A., Omiecinski, E. and Navathe, S.: An efficient algorithm for mining association rules in large databases, in 21st Very Large DataBase Conference, 1995, pp. 432\u2013444."},{"key":"9030_CR22","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"E. G. Talbi","year":"2002","unstructured":"Talbi, E. G.: A taxonomy of hybrid metaheuristics, Journal of Heuristics 8 (2002), 541\u2013564.","journal-title":"Journal of Heuristics"},{"key":"9030_CR23","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1287\/trsc.30.3.181","volume":"30","author":"P. J. Zwaneveld","year":"1996","unstructured":"Zwaneveld, P. J., Kroon, L. G., Romeijin, H. E., Salomon, M., Dauz\u00e8res-P\u00e9r\u00e8s, S., Van Hoesel, S. P. and Ambergen, H. W.: Routing trains through railway stations: model formulation and algorithms, Trans. Sci. 30 (1996), 181\u2013194.","journal-title":"Trans. Sci."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-9030-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-005-9030-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-9030-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T20:47:13Z","timestamp":1586638033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-005-9030-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12,29]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["9030"],"URL":"https:\/\/doi.org\/10.1007\/s10852-005-9030-1","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12,29]]}}}