EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003)

scientific article

Language	Label	Description	Also known as
English	EIA-CNDP: an exact iterative algorithm for critical node detection problem	scientific article

Statements

instance of

scholarly article

0 references

title

EIA-CNDP: an exact iterative algorithm for critical node detection problem (English)

0 references

author

Javad Rezaei

0 references

Fatemeh Zare-Mirakabad

0 references

S. A. MirHassani

0 references

Sayed-Amir Marashi

0 references

published in

Computers \& Operations Research

0 references

publication date

21 May 2021

0 references

zbMATH Keywords

exact algorithm

0 references

critical node

0 references

largest connected component

0 references

mixed integer linear programming

0 references

network vulnerability

0 references

describes a project that uses

SparseMatrix

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2020.105138

0 references

cites work

Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth

0 references

Hybrid constructive heuristics for the critical node problem

0 references

VNS solutions for the critical node problem

0 references

A genetic algorithm for a class of critical node problems

0 references

Detecting critical nodes in sparse graphs

0 references

Cardinality-Constrained Critical Node Detection Problem

0 references

Identifying sets of key players in a social network

0 references

The university of Florida sparse matrix collection

0 references

Bound and exact methods for assessing link vulnerability in complex networks

0 references

Complexity of the critical node problem over trees

0 references

Branch and cut algorithms for detecting critical nodes in undirected graphs

0 references

Variable neighbourhood search: methods and applications

0 references

A cutting-plane algorithm for solving a weighted influence interdiction problem

0 references

Optimal detection of critical nodes: improvements to model structure and performance

0 references

A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs

0 references

Component-cardinality-constrained critical node problem in graphs

0 references

The critical node detection problem in networks: a survey

0 references

Methods for removing links in a network to minimize the spread of infections

0 references

Robust Critical Node Selection by Benders Decomposition

0 references

Disconnecting graphs by removing vertices: a polyhedral approach

0 references

Computing Critical Nodes in Directed Graphs

0 references

Improved formulations for minimum connectivity network interdiction problems

0 references

Compact models for critical node detection in telecommunication networks

0 references

Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs

0 references

Exact interdiction models and algorithms for disconnecting networks via node deletions

0 references

Tabu search enhances network robustness under targeted attacks

0 references

Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem

0 references

A randomized algorithm with local search for containment of pandemic disease spread

0 references

A derandomized approximation algorithm for the critical node detection problem

0 references

A Region Growing Algorithm for Detecting Critical Nodes

0 references

A Fast Greedy Algorithm for the Critical Node Detection Problem

0 references

The bi-objective critical node detection problem

0 references

An integer programming framework for critical elements detection in graphs

0 references

Exact identification of critical nodes in sparse networks via new compact formulations

0 references

Selected Topics in Critical Element Detection

0 references

Discovering the influential users oriented to viral marketing based on online social networks

0 references

Identifiers

DOI

10.1016/j.cor.2020.105138

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2027003