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

DOI10.1016/J.COR.2015.11.001zbMath1349.92145OpenAlexW2184215007MaRDI QIDQ342308

Hugh R. Medal, Apurba K. Nandi

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.11.001

zbMATH Keywords

integer programmingnetwork interdictioncontamination minimizationedge manipulationlink removalspread of infections

Mathematics Subject Classification ID

Epidemiology (92D30) Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items (19)

A mixed-integer programming approach for locating jamming devices in a flow-jamming attack ⋮ Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model ⋮ Fortification Against Cascade Propagation Under Uncertainty ⋮ Efficient methods for the distance-based critical node detection problem in complex networks ⋮ Fair allocation of personal protective equipment to health centers during early phases of a pandemic ⋮ Content placement in 5G‐enabled edge/core data center networks resilient to link cut attacks ⋮ Logic-based Benders decomposition for wildfire suppression ⋮ Efficient approaches for attaining epidemic-free networks with minimum edge removal set ⋮ A game theoretic approach to discuss the positive secondary effect of vaccination scheme in an infinite and well-mixed population ⋮ Online self-organizing network control with time averaged weighted throughput objective ⋮ Literature review: the vaccine supply chain ⋮ An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections ⋮ Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs ⋮ Optimizing node infiltrations in complex networks by a local search based heuristic ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem ⋮ Shortest path network interdiction with incomplete information: a robust optimization approach ⋮ The costs of overcrowding (and release): strategic discharges for isolated facilities during epidemiological outbreaks ⋮ Benders decomposition algorithms for minimizing the spread of harmful contagions in networks ⋮ Soft rumor control in mobile instant messengers

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Link removal for the control of stochastically evolving epidemics over networks: a comparison of approaches
• A derandomized approximation algorithm for the critical node detection problem
• Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
• Edge removal in random contact networks and the basic reproduction number
• An integer programming framework for critical elements detection in graphs
• Optimal link removal for epidemic mitigation: A two-way partitioning approach
• Network theory and SARS: predicting outbreak diversity
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• Detecting critical nodes in sparse graphs
• A survey on Benders decomposition applied to fixed-charge network design problems
• A cutting plane algorithm for computing \(k\)-edge survivability of a network
• How the science of complex networks can help developing strategies against terrorism
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Exact identification of critical nodes in sparse networks via new compact formulations
• Emergence of Scaling in Random Networks
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Methods for removing links in a network to minimize the spread of infections