Hybrid constructive heuristics for the critical node problem
type: Item
instance of: scholarly article
title: Hybrid constructive heuristics for the critical node problem
zbMATH Open document ID: 1334.90185
author: Bernardetta Addis
author: Roberto Aringhieri
author: Andrea Grosso
author: Pierre Hosteins
published in: Annals of Operations Research
publication date: 2016-04-20T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6570960
zbMATH Keywords: critical node problem
zbMATH Keywords: graph fragmentation
zbMATH Keywords: hybrid heuristics
describes a project that uses: Algorithm 447
MaRDI profile type: Publication
full work available at URL: s10479-016-2110-y
OpenAlex ID: W2273546298
cites work: Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
cites work: VNS solutions for the critical node problem
cites work: Detecting critical nodes in sparse graphs
cites work: Identifying sets of key players in a social network
cites work: A faster algorithm for betweenness centrality*
cites work: Complexity of the critical node problem over trees
cites work: Branch and cut algorithms for detecting critical nodes in undirected graphs
cites work: Benchmarking optimization software with performance profiles.
cites work: Selected Topics in Critical Element Detection
cites work: Q4739657
cites work: Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions
cites work: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
cites work: A derandomized approximation algorithm for the critical node detection problem
cites work: Exact identification of critical nodes in sparse networks via new compact formulations
cites work: An integer programming framework for critical elements detection in graphs
cites work: Removing Arcs from a Network
cites work: Deterministic network interdiction
DOI: 10.1007/S10479-016-2110-Y
Recommended article: An optimal approach for the critical node problem using semidefinite programming
Recommended article: Q3792470
Recommended article: A genetic algorithm for a class of critical node problems
Recommended article: A hybrid heuristic for the maximum clique problem
Recommended article: Component-cardinality-constrained critical node problem in graphs
Recommended article: Efficient heuristic algorithm for identifying critical nodes in planar networks
Recommended article: Efficient implementation of heuristics for the continuous network design problem
Recommended article: A hybrid heuristic for the diameter constrained minimum spanning tree problem
Recommended article: Q3481517
description: scientific article; zbMATH DE number 6570960