Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
476152 | Computers & Operations Research | 2009 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Federico Della Croce, Andrea Grosso, Marco Locatelli,