Complexity among combinatorial problems from epidemics

DOI10.1111/itor.12444zbMath1382.90092OpenAlexW2746038421MaRDI QIDQ4608259

Franco Robledo, Pablo Romero, Juan Piccini

Publication date: 16 March 2018

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12444

zbMATH Keywords

computational complexitycombinatorial optimization problemgraph fragmentation problem

Mathematics Subject Classification ID

Epidemiology (92D30) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (1)

Graph fragmentation problem: analysis and synthesis

Cites Work

• Identifying sets of key players in a social network
• Analysis of a stochastic SIR epidemic on a random network incorporating household structure
• A probabilistic heuristic for a computationally difficult set covering problem
• Limit theorems for a random graph epidemic model
• Epidemics in a population with social structures
• Network-based analysis of stochastic SIR epidemic models with random and proportionate mixing
• Multiobjective GRASP with path relinking
• The Mathematics of Infectious Diseases
• The Structure and Function of Complex Networks
• Reducibility among Combinatorial Problems
• Acquaintance Vaccination in an Epidemic on a Random Graph with Specified Degree Distribution
• Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
• Epidemic spreading on weighted complex networks

This page was built for publication: Complexity among combinatorial problems from epidemics