Applications of the DM-GRASP heuristic: A survey

International Transactions in Operational Research

Volumn 15, Issue 4, 2008, Pages 387-416

  Santos, Luis F ^a   Martins, Simone L ^a   Plastino, Alexandre ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Data mining; GRASP; Hybrid metaheuristics

Indexed keywords

EID: 65549114813     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2008.00644.x     Document Type: Article

References (36)

1. Almeroth, K.C., 2000. The evolution of multicast: from the MBone to interdomain multicast to internet2 deployment. IEEE Network 10–20.
2. Andrade, P.M.F., Plastino, A., Ochi, L.S., Martins, S.L., 2003 GRASP for the Maximum Diversity Problem, Proceedings of MIC 2003, CD-ROM Paper: MIC03_15.
3. Atwood, J.W., 2004. A classification of reliable multicast protocols. IEEE Network 24–34.
4. Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B., 1999. Multicast security: a taxonomy and some efficient constructions. Proceedings of the IEEE INFOCOM'99 2, 700–716.
5. Deering, S.E., 1991. Multicast routing in a Datagram Internetwork. Ph.D. Thesis, Stanford University.
6. Delorme, X., Gandibleux, X., Rodriguez, J., 2003. GRASP for set packing problems. European Journal of Operational Research 153, 564–580.
7. Diot, C., Dabbous, W., Crowcroft, J., 1997. Multipoint communication: a survey of protocols, functions and mechanisms. IEEE Journal on Selected Areas in Communications 15, 3, 277–290.
8. Eriksson, H., 1994. MBONE: the multicast backbone. Communications of the ACM 37, 8, 54–60.
9. Feo, T.A., Resende, M.G.C., 1989. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8, 67–71.
10. Feo, T.A., Resende, M.G.C., 1995. Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133.
11. Festa, P., Resende, M.G.C., 2002. GRASP: An annotated bibliography. In: Ribeiro, C.C. and Hansen, P. (eds) Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, Norwell, MA, pp. 325–367.
12. Gandibleux, X., Delorme, X., T'Kindt, V., 2004. An ant colony algorithm for the set packing problem. Lecture Notes on Computer Science 3172, 49–60.
13. Garey, M.R., Johnson, D.S., 1979. Computers and intractability: a guide to the theory of NP-completeness. V.H. Freeman and Company, San Francisco.
14. Ghosh, J.B., 1996. Computational aspects of the maximum diversity problem. Operations Research Letters 19, 175–181.
15. Glover, F., Hersh, G., McMillan, C., 1977. Selecting subsets of maximum diversity, MS/IS Report No. 77-9, University of Colorado at Boulder.
16. Glover, F., Kuo, C-C., Dhir, K.S., 1996. Integer programming and heuristic approaches to the minimum diversity problem. Journal of Business and Management 4, 93–111.
17. Goethals, B., Zaki, M.J., 2003 Advances in frequent itemset mining implementations. Introduction to FIMI'03. IEEE ICDM FIMI Workshop.
18. Grahne, G., Zhu, J., 2003 Efficiently using prefix-trees in mining frequent itemsets. IEEE ICDM FIMI Workshop.
19. Guo, Y., Lim, A., Rodrigues, B., Zhu, Y., 2004. Heuristics for a brokering set packing problem. 8th International Symposium on Artificial Intelligence and Mathematics.
20. Han, J., Kamber, M., 2006. Data Mining: Concepts and Techniques (2nd edn), Morgan Kaufmann Publishing, California.
21. Kariv, O., Hakimi, S.L., 1979. An algorithmic approach to network location problems II: the p-medians. SIAM Journal of Applied Mathematics 37, 3, 513–538.
22. Kochenberger, G., Glover, F., 1999. Diversity data mining. Working Paper, The University of Mississipi.
23. Li, B., Chen, F., Yin, L.P., 2000. Server replication and its placement for reliable multicast. Proceedings of the 9th International Conference on Computer Communications and Networks, pp. 396–401.
24. Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L., 1998. An exact algorithm for the project scheduling with resource constraints based on a new mathematical formulation. Management Science 44, 714–729.
25. Nonnenmacher, J., Lacher, M.S., Jung, M., Biersack, E., Carle, G., 1998. How bad is reliable multicast without local recovery? In Proceedings of the IEEE INFOCOM'98, pp. 972–979.
26. Osman, I., Laporte, G., 1996. Metaheuristics: a bibliography. Annals of Operations Research 63, 513–623.
27. Prais, M., Ribeiro, C.C., 2000. Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing 12, 164–176.
28. Resende, M.G.C., Ribeiro, C.C., 2003. Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds) Handbook of Metaheuristics, Kluwer Academic Publishers, Norwell, MA, 219–249.
29. Ribeiro, M.H., Trindade, V.F., Plastino, A., Martins, S.L., 2004. Hybridization of GRASP metaheuristic with data mining techniques. Workshop on Hybrid Metaheuristcs in conjunction with the 16th European Conference on Artificial Intelligence, pp. 69–78.
30. Ribeiro, M.H.F., Plastino, A., Martins, S.L., 2006. Hybridization of GRASP metaheuristic with data mining techniques. Journal of Mathematical Modelling and Algorithms 5, 1, 23–41.
31. Santos, L.F., Ribeiro, M.H.F., Plastino, A., Martins, S.L., 2005. A hybrid GRASP with data mining for the Maximum Diversity Problem. Proceedings of the 2nd International Workshop on Hybrid Metaheuristics (LNCS 3636), pp. 116–127.
32. 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. Proceedings of the IEEE GLOBECOM Conference.
33. Silva, G.C., Ochi, L.S., Martins, S.L., 2004. Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem. Lecture Notes on Computer Science 3059, 498–512.
34. Talbi, E.G., 2002. A taxonomy of hybrid metaheuristics. Journal of Heuristics 8, 541–564.
35. Weitz, R., Lakshminarayanan, S., 1998. An empirical comparison of heuristic methods for creating maximally diverse groups. Journal of the Operational Research. Society 49, 635–646.
36. Zwaneveld, P.J., Kroon, L.G., Romeijin, H.E., Salomon, M., Dauzères-Pérès, S., Van Hoesel, S.P., Ambergen, H.W., 1996. Routing trains through railway stations: model formulation and algorithms. Transportation Science 30, 181–194.