A heuristic approach for the max-min diversity problem based on max-clique

Computers and Operations Research

Volumn 36, Issue 8, 2009, Pages 2429-2433

  Della Croce, Federico ^a   Grosso, Andrea ^b   Locatelli, Marco ^b  

^a POLITECNICO DI TORINO   (Italy)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

m Dispersion; m Facility dispersion; Max clique; Max min diversity

Indexed keywords

DISPERSIONS; HEURISTIC METHODS;

CPU TIME; DECISION PROBLEMS; M-DISPERSION; M-FACILITY DISPERSION; MAX-CLIQUE; MAX-MIN DIVERSITY;

DISPERSION (WAVES);

EID: 58549092051     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.09.007     Document Type: Article

References (18)

1. Aringhieri R., Cordone R., and Melzani Y. Tabu Search versus GRASP for the maximum diversity problem. 4OR 6 1 (2008) 45-60
2. Duarte A., and Martí R. Tabu Search and GRASP for the maximum diversity problem. European Journal of Operational Research 178 (2007) 71-84
3. Glover F., Kuo C.C., and Dhir K.S. Heuristic algorithm for the maximum diversity problem. Journal of Information and Optimization Sciences 19 (1998) 109-132
4. Silva G.C., Ochi L.S., and Martins S.L. Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem. Lecture notes in computer science vol. 3059 (2004), Springer, Berlin 498-512
5. Chandrasekaran R., and Daughety A. Location on tree networks: p-centre and n-dispersion problems. Mathematics of Operations Research 6 (1981) 50-57
6. Erkut E. The discrete p-dispersion problem. European Journal of Operational Research 46 (1990) 48-60
7. Ghosh J.B. Computational aspects of the maximum diversity problem. Operations Research Letters 19 (1996) 175-181
8. Ravi S.S., Rosenkrantz D.J., and Tayi G.K. Facility dispersion problems: heuristics and special cases. In: Nisha A. (Ed). Proceedings of the 2nd workshop on algorithms and data structures. Lecture notes in computer science vol. 519 (1991), Springer, Berlin 355-366
9. Agca S., Eksioglu B., and Ghosh J.B. Lagrangian solution of maximum dispersion problems. Naval Research Logistics 47 (2000) 97-114
10. Kuo C.C., Glover F., and Dhir K.S. Analyzing and modeling the maximum diversity problem by zero-one programming. Decision Sciences 24 (1993) 1171-1185
11. Kincaid R.K. Good solutions to discrete noxious location problems via metaheuristics. Annals of Operations Research 40 (1992) 265-281
12. Resende MGC, Martí R, Gallego M, Duarte A. GRASP and path relinking for the max-min diversity problem. Computers and Operations Research, in press, doi:10.1016/j.cor.2008.05.011.
13. Downey R.G., and Fellows M.R. Fixed parameter tractability and completeness I: basic theory. SIAM Journal on Computing 24 (1995) 873-921
14. Downey R.G., and Fellows M.R. Fixed parameter tractability and completeness II: completeness for W[I]. Theoretical Computer Science 141 (1995) 109-131
15. Woeginger G.J. Exact algorithms for NP-hard problems: a survey. In: Juenger M., Reinelt G., and Rinaldi G. (Eds). Combinatorial optimization-eureka! you shrink!. Lecture notes in computer science vol. 2570 (2003), Springer, Berlin 185-207
16. 0.288 n) independent set algorithm. In: ACM-SIAM symposium on discrete algorithms (SODA); 2006. p. 18-25.
17. Grosso A, Locatelli M, Pullan W. Randomness, plateau search, penalties, restart rules: simple ingredients leading to very efficient heuristics for the maximum clique problem. Journal of Heuristics, doi:10.1007/s10732-007-9055-x.
18. Östergard P.R.J. A fast algorithm for the maximum clique problem. Discrete Applied Mathematics 120 (2002) 197-207