Location-coverage models for preventing attacks on interurban transportation networks
From MaRDI portal
Publication:1686522
DOI10.1007/s10479-015-2087-yzbMath1381.90051OpenAlexW2240103095MaRDI QIDQ1686522
Publication date: 15 December 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-2087-y
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Cites Work
- A note on two problems in connexion with graphs
- An improved formulation for the maximum coverage patrol routing problem
- Location-allocation models for traffic police patrol vehicles on an interurban network
- The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem
- The maximum covering/shortest path problem: A multiobjective network design and routing formulation
- A multi-objective model for locating fire stations
- Location analysis: a synthesis and survey
- Ambulance location and relocation models.
- Determining optimal police patrol areas with maximal covering and backup covering location models
- A multiperiod set covering location model for dynamic redeployment of ambulances
- Multiobjective analysis of facility location decisions
- Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs
- The Maximal Expected Covering Location Problem: Revisited
- Clustering Sensors in Wireless Ad Hoc Networks Operating in a Threat Environment
- The Location of Emergency Service Facilities
- The generalized maximal covering location problem
This page was built for publication: Location-coverage models for preventing attacks on interurban transportation networks
