Hybrid constructive heuristics for the critical node problem

Bernardetta Addis

doi:10.1007/s10479-016-2110-y

Hybrid constructive heuristics for the critical node problem

2016-02-12

38

OA

AI

DOI：10.1007/s10479-016-2110-y

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Critical node problem

Graph fragmentation

Hybrid heuristics

Hybrid constructive heuristics for the critical node problem

Abstract

Journal

Organization