The variable radius covering problem

DOI10.1016/j.ejor.2008.03.046zbMath1163.90590OpenAlexW2070048370MaRDI QIDQ1027534

George O. Wesolowsky, Dmitry Krass, Zvi Drezner, Oded Berman

Publication date: 30 June 2009

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

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

zbMATH Keywords

networkheuristicsplanarcoverlocationdiscrete

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Management decision making, including multiple objectives (90B50) Dynamic programming (90C39) Discrete location and assignment (90B80)

Related Items

The multi-facility median problem with Pos/Neg weights on general graphs ⋮ A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover ⋮ Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities ⋮ Multi-type maximal covering location problems: hybridizing discrete and continuous problems ⋮ An iterated local search for the budget constrained generalized maximal covering location problem ⋮ Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods ⋮ The minimal covering location and sizing problem in the presence of gradual cooperative coverage ⋮ An exact solution framework for the multiple gradual cover location problem ⋮ Generalized coverage: new developments in covering location models ⋮ Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution ⋮ Fuzzy covering location problems with different aggregation operators

Uses Software

• OR-Library
• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Solving a huff-like competitive location and design model for profit maximization in the plane
• Competitive facility location and design problem
• The p-cover problem
• Heuristic procedures for the m-partial cover problem on a plane
• Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
• Degeneracy in the multi-source Weber problem
• The \(p\) maximal cover -- \(p\) partial center problem on networks
• The gradual covering decay location problem on a network.
• Undesirable facility location with minimal covering objectives
• Optimal location and design of a competitive facility
• The Maximal Expected Covering Location Problem: Revisited
• The gradual covering problem
• The Maximum Coverage Location Problem
• Location-Allocation Problems
• Note—On a Modified One-Center Model
• The p-center location problem in an area
• Heuristic Methods for Location-Allocation Problems
• The generalized maximal covering location problem