Aggregation error for location models: Survey and analysis
From MaRDI portal
Publication:1026594
DOI10.1007/s10479-008-0344-zzbMath1173.90005OpenAlexW2080534851MaRDI QIDQ1026594
Richard L. Francis, Timothy J. Lowe, Arie Tamir, M. Brenda Rayco
Publication date: 25 June 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0344-z
Related Items
A modular capacitated multi-objective model for locating maritime search and rescue vessels, A note on equity across groups in facility location, A scalable exact algorithm for the vertex \(p\)-center problem, A multi-objective model for locating search and rescue boats, A quadtree-based allocation method for a class of large discrete Euclidean location problems, 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, The gravity multiple server location problem, New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem, Ambulance location and relocation problems with time-dependent travel times, Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search, Does Euclidean distance work well when the \(p\)-median model is applied in rural areas?, Comparative error bound theory for three location models: continuous demand versus discrete demand, \(k\)-means genetic algorithms with greedy genetic operators, Location-allocation models for traffic police patrol vehicles on an interurban network, Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities, An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems, On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems, The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique, A new model for maximal coverage exploiting GIS capabilities, Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem, Distance measure and the \(p\)-median problem in rural areas
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On worst-case aggregation analysis for network location problems
- Demand point aggregation for planar covering location models
- Aggregation in hub location problems
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- Aggregation effects in maximum covering models
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Analytical models for locating undesirable facilities
- Probabilistic analysis of some Euclidean clustering problems
- Improved complexity bounds for location problems on the real line
- GBSSS: The generalized big square small square method for planar single- facility location
- Semi-obnoxious location models: A global optimization approach
- Analysis of aggregation errors for the \(p\)-median problem
- The demand partitioning method for reducing aggregation errors in \(p\)-median problems
- A \(p\)-center grid-positioning aggregation procedure
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
- Metaheuristic. Computer decision-making. Papers from the 4th Metaheuristics International Conference (MIC2001) held in Porto (Portugal), July 16--20, 2001. With assistance from Ana Viana
- Location science research: a review
- Aggregation and surrogation error in the \(p\)-median model
- Exact and approximation algorithms for clustering
- Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
- Data surrogation error in \(p\)-median models
- A framework for demand point and solution space aggregation analysis for location models
- Clustering motion
- A flexible approach to location problems
- Location Theory
- On the Complexity of Some Common Geometric Location Problems
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- On coresets for k-means and k-median clustering
- Probabilistic Analysis of Geometric Location Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Finite Dominating Sets for Network Location Problems
- The Voronoi Partition of a Network and Its Implications in Location Theory
- Objective function approximations in mathematical programming
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Error-bound driven demand point aggregation for the rectilinear distance p-center model
- Dynamic facility location: The progressive p-median problem
- Replacing continuous demand with discrete demand in a competitive location model
- Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems
- Aggregation Error Bounds for a Class of Location Models
- Worst-case incremental analysis for a class ofp-facility location problems
- Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network
- An aggregation approach to solving the networkp-median problem with link demands
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Convex Analysis
- Row-Column Aggregation for Rectilinear Distance p-Median Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Subadditive functions
- Solving nonconvex planar location problems by finite dominating sets
- Geometry helps in bottleneck matching and related problems
