An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections
From MaRDI portal
Publication:1756351
DOI10.1016/j.disopt.2018.06.005zbMath1454.92028OpenAlexW2809715530MaRDI QIDQ1756351
Tapas K. Das, Vignesh Subramanian, Hadi Charkhgard, Walter Silva
Publication date: 14 January 2019
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2018.06.005
Epidemiology (92D30) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)
Related Items
Solving the Distance-Based Critical Node Problem, A fast tri-individual memetic search approach for the distance-based critical node problem
Cites Work
- A derandomized approximation algorithm for the critical node detection problem
- Multi-objective optimization models for patient allocation during a pandemic influenza outbreak
- Methods for removing links in a network to minimize the spread of infections
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
- An integer programming framework for critical elements detection in graphs
- Optimal link removal for epidemic mitigation: A two-way partitioning approach
- Detecting critical nodes in sparse graphs
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- A cutting-plane algorithm for solving a weighted influence interdiction problem
- 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
- Improving Discrete Model Representations via Symmetry Considerations
- Symmetry in Integer Linear Programming
- Benchmarking optimization software with performance profiles.
