Generalized coverage: new developments in covering location models

DOI10.1016/j.cor.2009.11.003zbMath1188.90147OpenAlexW2162165222MaRDI QIDQ976025

Zvi Drezner, Oded Berman, Dmitry Krass

Publication date: 11 June 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.11.003

zbMATH Keywords

locationgradual covercooperative covercovering modelsvariable radius

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items

Mid-term capacity redeployment of Rescue Centers under simultaneous requirements ⋮ On the Parameterized Complexity of the Expected Coverage Problem ⋮ A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage ⋮ Covering part of a planar network ⋮ The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane ⋮ On the parameterized complexity of the expected coverage problem ⋮ A unified solving approach for two and three dimensional coverage problems in sensor networks ⋮ A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ Demand point aggregation method for covering problems with gradual coverage ⋮ The multimode covering location problem ⋮ 3-D Dynamic UAV Base Station Location Problem ⋮ Locating a minisum annulus: a new partial coverage distance model ⋮ Minmax regret maximal covering location problems with edge demands ⋮ Integer linear programming models for grid-based light post location problem ⋮ Directional approach to gradual cover: a maximin objective ⋮ The generalized discrete ‐centroid problem ⋮ Covering models and optimization techniques for emergency response facility location and planning: a review ⋮ Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities ⋮ Gradual cover competitive facility location ⋮ Sequential competitive location on networks ⋮ On the Weber facility location problem with limited distances and side constraints ⋮ On the overlap area of a disk and a piecewise circular domain ⋮ Approximation of the competitive facility location problem with MIPs ⋮ Location-allocation models for traffic police patrol vehicles on an interurban network ⋮ The maximin gradual cover location problem ⋮ An iterated local search for the budget constrained generalized maximal covering location problem ⋮ New models for the location of controversial facilities: a bilevel programming approach ⋮ The minimal covering location and sizing problem in the presence of gradual cooperative coverage ⋮ Maximizing the minimum cover probability by emergency facilities ⋮ Multi-period stochastic covering location problems: modeling framework and solution approach ⋮ Incorporating the threat of terrorist attacks in the design of public service facility networks ⋮ Cooperative cover of uniform demand ⋮ Generalized coverage: new developments in covering location models ⋮ Covering problems with polyellipsoids: a location analysis perspective ⋮ Directional approach to gradual cover: the continuous case ⋮ On the fuzzy maximal covering location problem ⋮ Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution ⋮ On a class of covering problems with variable capacities in wireless networks ⋮ Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure
• The ordered gradual covering location problem on a network
• Generalized coverage: new developments in covering location models
• A general global optimization approach for solving location problems in the plane
• A decomposition approach for the probabilistic maximal covering location-allocation problem
• The variable radius covering problem
• On a circle placement problem
• The p-cover problem
• Heuristic procedures for the m-partial cover problem on a plane
• Facility siting and integer-friendly programming
• The gradual covering decay location problem on a network.
• Location of preventive health care facilities
• A maximal covering location model in the presence of partial coverage
• Solving the ordered one-median problem in the plane
• Finding the optimal solution to the Huff based competitive location model
• Discrete models for competitive location with foresight
• Location Theory
• The gradual covering problem
• The Maximal Covering Location Problem with Capacities on Total Workload
• Model formulations for hub covering problems
• Locating emergency services with different priorities: the priority queuing covering location problem
• A stochastic gradual cover location problem
• A defensive maximal covering problem on a network
• The probabilistic 1-maximal covering problem on a network with discrete demand weights
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• Location-Allocation Problems
• Two algorithms for constructing a Delaunay triangulation
• Note—On a Modified One-Center Model
• The Facility Location Problem with Limited Distances
• Heuristic Methods for Location-Allocation Problems
• Computer Solutions to Minimum-Cover Problems
• A dynamic programming algorithm for the conditional covering problem on tree graphs
• The generalized maximal covering location problem