Transportation Science · 1996 · 40 citations · 18 references
ComputingComputer ScienceAlgorithmsComputational GeometryOptimizationAggregate DemandApproximation AlgorithmsCombinatorial OptimizationLarge-scale OptimizationP-median ProblemAggregationApproximation Algorithms For P-medianColumnsDiscrete P-median ProblemUpper Bound Computation
For large-scale p-median problems, it is common to aggregate the demand points. This size reduction via aggregation makes the problem easier to solve, but introduces error. Doing this aggregation well is provably difficult. We present a median-row-column aggregation algorithm, MRC, with provable properties including an error bound, an (attainable) upper bound on the maximum objective function error. MRC adjusts spacing of individual rows and columns to exploit problem structure. For e demand points, r rows, and c columns, the algorithm has computational order e(c + r + log e), and order e storage requirements. We report encouraging computational experience.
18
Computational geometry. an introduction
Franco P. Preparata, Michael Ian Shamos · 1985 · 2.4K citations
Leon N. Cooper · Operations Research · 1963 · 928 citations