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

Authors:
Federico Della Croce;Andrea Grosso;Marco Locatelli
Affiliations:
Dipartimento di Automatica ed Informatica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy;Dipartimento di Informatica, Universití di Torino, Corso Svizzera, 185, 10149 Torino, Italy;Dipartimento di Informatica, Universití di Torino, Corso Svizzera, 185, 10149 Torino, Italy
Venue:
Computers and Operations Research
Year:
2009

Citing 8
Cited 0

Good solutions to discrete noxious location problems via metaheuristics

Annals of Operations Research - Special issue on locational decisions
Fixed-parameter tractability and completeness II: on completeness for W[1]

Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results

SIAM Journal on Computing
A fast algorithm for the maximum clique problem

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
Measure and conquer: a simple O(20.288n) independent set algorithm

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Simple ingredients leading to very efficient heuristics for the maximum clique problem

Journal of Heuristics
GRASP and path relinking for the max-min diversity problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

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.