Location covering models. History, applications and advancements

DOI10.1007/978-3-319-99846-6zbMath1432.90004OpenAlexW2946619050MaRDI QIDQ1755145

Richard L. Church, Alan T. Murray

Publication date: 7 January 2019

Published in: Advances in Spatial Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-99846-6

zbMATH Keywords

reliabilitymixed integer programmingcapturedisruptionlocation set coveringmaximal coveringanti-coverinterdiction

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) General theory of mathematical modeling (00A71)

Related Items (9)

Continuous maximal covering location problems with interconnected facilities ⋮ Review of obnoxious facilities location problems ⋮ A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes ⋮ A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation ⋮ The concept of modeling packing and covering problems using modern computational geometry software ⋮ Multi-type maximal covering location problems: hybridizing discrete and continuous problems ⋮ The weighted intruder path covering problem ⋮ A support tool for planning classrooms considering social distancing between students ⋮ Service allocation equity in location coverage analytics

This page was built for publication: Location covering models. History, applications and advancements