A defensive maximal covering problem on a network
From MaRDI portal
Publication:3601204
DOI10.1111/j.1475-3995.2009.00660.xzbMath1153.90332MaRDI QIDQ3601204
No author found.
Publication date: 10 February 2009
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00660.x
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Related Items
Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing, Designing robust coverage networks to hedge against worst-case facility losses, A mixed integer linear program and tabu search approach for the complementary edge covering problem, Generalized coverage: new developments in covering location models, The stochastic interdiction median problem with disruption intensity levels
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
- The gradual covering decay location problem on a network.
- Locating service facilities whose reliability is distance dependent.
- Deterministic network interdiction
- Undesirable facility location with minimal covering objectives
- Future paths for integer programming and links to artificial intelligence
- A bilevel mixed-integer program for critical infrastructure protection planning
- Non-cooperative games
- The Maximal Expected Covering Location Problem: Revisited
- The gradual covering problem
- The facility and transfer points location problem
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Removing Arcs from a Network
- On solving unreliable planar location problems
- The generalized maximal covering location problem
