PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem - Université d'Angers Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2017

PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem

Résumé

The Maximum Vertex Weight Clique Problem (MVWCP) is an important generalization of the well-known NP-hard Maximum Clique Problem. In this paper, we introduce a generalized move operator called PUSH, which generalizes the conventional ADD and SWAP operators commonly used in the literature and can be integrated in a local search algorithm for MVWCP. The PUSH operator also offers opportunities to define new search operators by considering dedicated candidate push sets. To demonstrate the usefulness of the proposed operator, we implement two simple tabu search algorithms which use PUSH to explore different candidate push sets. The computational results on 142 benchmark instances from different sources (DIMACS, BHOSLIB, and Winner Determination Problem) indicate that these algorithms compete favorably with the leading MVWCP algorithms.

Fichier principal
Vignette du fichier
zhouhaogoeffonejor2017.pdf (210.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01426414 , version 1 (04-01-2017)
hal-01426414 , version 2 (04-06-2017)

Identifiants

Citer

Yi Zhou, Jin-Kao Hao, Adrien Goëffon. PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem. European Journal of Operational Research, 2017, 257 (1), pp.41-54. ⟨10.1016/j.ejor.2016.07.056⟩. ⟨hal-01426414v2⟩

Collections

UNIV-ANGERS LERIA
98 Consultations
198 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More