Solving the maximum vertex weight clique problem via binary quadratic programming - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Optimization Année : 2016

Solving the maximum vertex weight clique problem via binary quadratic programming

Résumé

In recent years, the general binary quadratic programming (BQP) model has been widely applied to solve a number of combinatorial optimization problems. In this paper, we recast the maximum vertex weight clique problem (MVWCP) into this model which is then solved by a probabilistic tabu search algorithm designed for the BQP. Experimental results on 80 challenging DIMACS-W and 40 BHOSLIB-W benchmark instances demonstrate that this general approach is viable for solving the MVWCP problem.
Fichier principal
Vignette du fichier
Wang2016.pdf (175.78 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01412535 , version 1 (17-06-2021)

Licence

Paternité

Identifiants

Citer

Yang Wang, Jin-Kao Hao, Fred Glover, Zhipeng Lü, Qinghua Wu. Solving the maximum vertex weight clique problem via binary quadratic programming. Journal of Combinatorial Optimization, 2016, 32 (2), pp.531-549. ⟨10.1007/s10878-016-9990-2⟩. ⟨hal-01412535⟩

Collections

UNIV-ANGERS LERIA
57 Consultations
92 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More