Modularity maximization to design contiguous policy zones for pandemic response

DOI10.1016/j.ejor.2022.01.012OpenAlexW4206206513WikidataQ114184371 ScholiaQ114184371MaRDI QIDQ2171547

C. Derrick Huang, Mohsen Emadikhiav, Milad Baghersad, Ravi S. Behara

Publication date: 9 September 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.01.012

zbMATH Keywords

OR in disaster reliefmodularity maximizationcolumn-generation algorithmcontiguous community detectionpandemic response coordination

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Introduction to the special issue on the role of operational research in future epidemics/ pandemics

Cites Work

• MILP formulations for the modularity density maximization problem
• A multi-criteria police districting problem for the efficient and effective design of patrol sector
• Optimal design of compact and functionally contiguous conservation management areas
• Optimal political districting
• An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
• Efficient modularity density heuristics for large graphs
• A simulated annealing genetic algorithm for the electrical power districting problem
• A tabu search heuristic and adaptive memory procedure for political districting
• A multi-objective districting problem applied to agricultural machinery maintenance service network
• A new integer linear programming formulation for the problem of political districting
• Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints
• Political districting: from classical models to recent approaches
• Local search algorithms for political districting
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• School redistricting: embedding GIS tools with integer programming
• Imposing Connectivity Constraints in Forest Planning Models
• Fast unfolding of communities in large networks
• Computing Communities in Large Networks Using Random Walks
• Branch-and-Bound Methods: A Survey
• Optimal Political Districting by Implicit Enumeration Techniques

This page was built for publication: Modularity maximization to design contiguous policy zones for pandemic response