Name
Abstract | ||
|---|---|---|
In this paper we discuss a heuristic approach for the solution to the max-min diversity problem. The approach relies on the equivalence between this problem and the classical max-clique: it solves different decision problems about the existence of cliques with a given size. The idea is rather simple but, according to the experiments and the comparison with the existing literature, appears as particularly promising and outperforms, both in quality and CPU time, the existing state of the art algorithms. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.cor.2008.09.007 | Computers & OR |
Keywords | DocType | Volume |
Max-clique,existing literature,existing state,m -Facility dispersion,art algorithm,CPU time,m -Dispersion,different decision problem,classical max-clique,max-min diversity problem,heuristic approach,Max–min diversity | Journal | 36 |
Issue | ISSN | Citations |
8 | Computers and Operations Research | 17 |
PageRank | References | Authors |
0.96 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Federico Della Croce | 1 | 399 | 41.60 |
| Andrea Grosso | 2 | 450 | 28.55 |
| Marco Locatelli | 3 | 926 | 80.28 |