Hybrid constructive heuristics for the critical node problem - Department of Networks, Systems and Services
Article Dans Une Revue Annals of Operations Research Année : 2016

Hybrid constructive heuristics for the critical node problem

Résumé

We consider the Critical Node Problem: given an undirected graph and an integer number K, at most K nodes have to be deleted from the graph in order to minimize a connectivity measure in the residual graph. We combine the basic steps used in common greedy algorithms with some flavour of local search, in order to obtain simple hybrid heuristic algorithms. The obtained algorithms are shown to be effective, delivering improved performances (solution quality and speed) with respect to known greedy algorithms and other more sophisticated state of the art methods.
Fichier principal
Vignette du fichier
2016-CNP-ANOR-PostPrint.pdf (607.83 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01307739 , version 1 (09-01-2025)

Identifiants

Citer

Bernardetta Addis, Roberto Aringhieri, Andrea Grosso, Pierre Hosteins. Hybrid constructive heuristics for the critical node problem. Annals of Operations Research, 2016, 238 (1-2), pp.637-649. ⟨10.1007/s10479-016-2110-y⟩. ⟨hal-01307739⟩
107 Consultations
0 Téléchargements

Altmetric

Partager

More