Aggregation Error Bounds for a Class of Location Models

DOI10.1287/OPRE.48.2.294.12382zbMATH Open1106.90355OpenAlexW2076660719MaRDI QIDQ4530649FDOQ4530649

Authors: Richard L. Francis, Timothy J. Lowe, Arie Tamir 

Publication date: 4 June 2002

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

Full work available at URL: https://doi.org/10.1287/opre.48.2.294.12382

Recommendations

• Aggregation error for location models: Survey and analysis
• Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
• New error bounds in continuous minisum location for aggregation at the gravity centre
• A framework for demand point and solution space aggregation analysis for location models
• Comparative error bound theory for three location models: continuous demand versus discrete demand

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Continuous location (90B85)

Cited In (34)

• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
• Exact procedures for solving the discrete ordered median problem
• New error bounds in continuous minisum location for aggregation at the gravity centre
• On the ordered anti-Weber problem for any norm in \(\mathbb R^2\)
• Locating tree-shaped facilities using the ordered median objective
• The \(p\)-median problem: a survey of metaheuristic approaches
• Robust defibrillator deployment under cardiac arrest location uncertainty via row-and-column generation
• Locating hyperplanes to fitting set of points: a general framework
• The gravity multiple server location problem
• Comparative error bound theory for three location models: continuous demand versus discrete demand
• Title not available (Why is that?)
• Heuristic procedures for solving the discrete ordered median problem
• On the exponential cardinality of FDS for the ordered \(p\)-median problem
• Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median
• A quadtree-based allocation method for a class of large discrete Euclidean location problems
• Distribution systems design with role dependent objectives
• The \(p\)-facility ordered median problem on networks
• The stochastic \(p\)-median problem with unknown cost probability distribution
• Tradeoff analysis of cost and aggregation error for some location models
• Aggregation error for location models: Survey and analysis
• A flexible model and efficient solution strategies for discrete location problems
• US coast guard air station location with respect to distress calls: a spatial statistics and optimization based methodology
• Demand point aggregation for planar covering location models
• Worst-case incremental analysis for a class ofp-facility location problems
• Aggregation in hub location problems
• Ambulance location and relocation models.
• Optimization problems with flexible objectives: a general modeling approach and applications
• Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem
• Algorithmic results for ordered median problems
• Location Science in Canada
• A framework for demand point and solution space aggregation analysis for location models
• An aggregation heuristic for large scale p-median problem
• Minimizing the sum of the \(k\) largest functions in linear time.
• An extended covering model for flexible discrete and equity location problems

This page was built for publication: Aggregation Error Bounds for a Class of Location Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530649)