Demand point aggregation for planar covering location models

DOI10.1007/s10479-005-2044-2zbMath1114.90057OpenAlexW2004725868MaRDI QIDQ816417

H. Emir-Farinas, Richard L. Francis

Publication date: 9 March 2006

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-005-2044-2

zbMATH Keywords

location modelscovering problemdemand point aggregation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items

A framework for demand point and solution space aggregation analysis for location models, Demand point aggregation method for covering problems with gradual coverage, Emergency medical services and beyond: addressing new challenges through a wide literature review, Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region, Continuous maximal covering location problems with interconnected facilities, Multiobjective evolutionary algorithms to identify highly autocorrelated areas: the case of spatial distribution in financially compromised farms, A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints, Aggregation error for location models: Survey and analysis

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On worst-case aggregation analysis for network location problems
• A simple heuristic for the p-centre problem
• Aggregation effects in maximum covering models
• Review, extension and prediction in emergency service siting models
• Analysis of aggregation errors for the \(p\)-median problem
• A \(p\)-center grid-positioning aggregation procedure
• Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
• Hierarchical solution of network flow problems
• On the Complexity of Some Common Geometric Location Problems
• Probabilistic Analysis of Geometric Location Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Error-bound driven demand point aggregation for the rectilinear distance p-center model
• Dynamic facility location: The progressive p-median problem
• Aggregation Error Bounds for a Class of Location Models
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• The m-Center Problem
• The Optimum Location of Multi-centres on a Graph
• Row-Column Aggregation for Rectilinear Distance p-Median Problems