Generalized coverage: new developments in covering location models

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

Dmitry Krass, Zvi Drezner, Oded Berman

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

location; gradual cover; cooperative cover; covering models; variable radius

Mathematics Subject Classification ID

90B85: Continuous location

Related Items

Sequential competitive location on networks, Generalized coverage: new developments in covering location models, Incorporating the threat of terrorist attacks in the design of public service facility networks, Integer linear programming models for grid-based light post location problem, Covering models and optimization techniques for emergency response facility location and planning: a review, On the Weber facility location problem with limited distances and side constraints

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