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.

A heuristic approach for the Max-Min Diversity Problem based on Max Clique / DELLA CROCE DI DOJOLA, Federico; A., Grosso; Locatelli, Marco. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 36:(2009), pp. 2429-2433. [10.1016/j.cor.2008.09.007]

A heuristic approach for the Max-Min Diversity Problem based on Max Clique

DELLA CROCE DI DOJOLA, Federico;LOCATELLI, MARCO
2009

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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/1849386
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo