Optimal link removal for epidemic mitigation: A two-way partitioning approach

DOI10.1016/j.mbs.2011.11.006zbMath1237.92053OpenAlexW1989798013WikidataQ36211643 ScholiaQ36211643MaRDI QIDQ423087

Eva A. Enns, Margaret L. Brandeau, Jeffrey J. Mounzer

Publication date: 18 May 2012

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc3434711

zbMATH Keywords

optimizationnetworksepidemic controlquarantine

Mathematics Subject Classification ID

Epidemiology (92D30) Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Applications of optimal control and differential games (49N90)

Related Items

Link removal for the control of stochastically evolving epidemics over networks: a comparison of approaches ⋮ Methods for removing links in a network to minimize the spread of infections ⋮ Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models ⋮ Multi-competitive viruses over time-varying networks with mutations and human awareness ⋮ Efficient approaches for attaining epidemic-free networks with minimum edge removal set ⋮ An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities ⋮ Soft rumor control in mobile instant messengers ⋮ Epidemic control analysis: designing targeted intervention strategies against epidemics propagated on contact networks

Uses Software

• SDPT3
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Solving semidefinite-quadratic-linear programs using SDPT3
• An efficient approach to solve the large-scale semidefinite programming problems
• Network structure, and vaccination strategy and effort interact to affect the dynamics of influenza epidemics
• Graph Implementations for Nonsmooth Convex Programs
• Emergence of Scaling in Random Networks
• A critical point for random graphs with a given degree sequence
• Semidefinite Programming
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks
• SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)