Hybrid constructive heuristics for the critical node problem

DOI10.1007/S10479-016-2110-YMaRDI QIDQ271993zbMATH OpenOpenAlexFDO

Authors Bernardetta Addis, Roberto Aringhieri, Andrea Grosso, Pierre Hosteins

Publication date 20 April 2016

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-016-2110-y

zbMATH Keywords

critical node problemgraph fragmentationhybrid heuristics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An optimal approach for the critical node problem using semidefinite programming
• scientific article; zbMATH DE number 4057268
• A genetic algorithm for a class of critical node problems
• A hybrid heuristic for the maximum clique problem
• Component-cardinality-constrained critical node problem in graphs
• Efficient heuristic algorithm for identifying critical nodes in planar networks
• Efficient implementation of heuristics for the continuous network design problem
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• scientific article; zbMATH DE number 4152177

Cites work

• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A derandomized approximation algorithm for the critical node detection problem
• A faster algorithm for betweenness centrality*
• An integer programming framework for critical elements detection in graphs
• Benchmarking optimization software with performance profiles.
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Complexity of the critical node problem over trees
• Detecting critical nodes in sparse graphs
• Deterministic network interdiction
• Exact identification of critical nodes in sparse networks via new compact formulations
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Identifying sets of key players in a social network
• Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
• Removing Arcs from a Network
• Selected topics in critical element detection
• VNS solutions for the critical node problem

Cited in

(16)

• EIA-CNDP: an exact iterative algorithm for critical node detection problem
• Solving the Distance-Based Critical Node Problem
• Efficient methods for the distance-based critical node detection problem in complex networks
• A genetic algorithm for a class of critical node problems
• Critical node detection problem for complex network in undirected weighted networks
• Complexity of the multilevel critical node problem
• A fast tri-individual memetic search approach for the distance-based critical node problem
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
• Critical node/edge detection problems on trees
• Efficient heuristic algorithm for identifying critical nodes in planar networks
• VNS solutions for the critical node problem
• The connected critical node problem
• The bi-objective critical node detection problem
• A preliminary analysis of the distance based critical node problem
• The critical node detection problem in networks: a survey
• The daily swab test collection problem

Describes a project that uses

Uses Software

• Algorithm 447

This page was built for publication: Hybrid constructive heuristics for the critical node problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q271993)