Row-Column Aggregation for Rectilinear Distance p-Median Problems

DOI10.1287/trsc.30.2.160zbMath0865.90087OpenAlexW2120079907MaRDI QIDQ5689806

Timothy J. Lowe, Richard L. Francis, M. Brenda Rayco

Publication date: 7 January 1997

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.30.2.160

zbMATH Keywords

rectilinear distanceinstitutional location problemslarge-scale \(p\)-median problemsmedian-row-column aggregation algorithm

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (15)

Aggregation in hub location problems ⋮ Worst-case incremental analysis for a class ofp-facility location problems ⋮ On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre ⋮ A quadtree-based allocation method for a class of large discrete Euclidean location problems ⋮ Demand point aggregation method for covering problems with gradual coverage ⋮ On solving large instances of the capacitated facility location problem ⋮ A continuous approximation approach for the integrated facility-inventory allocation problem ⋮ Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search ⋮ An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems ⋮ Geographical information systems and location science ⋮ Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem ⋮ Aggregation error for location models: Survey and analysis ⋮ Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem ⋮ Demand point aggregation for planar covering location models ⋮ The \(K\)-connection location problem in a plane

This page was built for publication: Row-Column Aggregation for Rectilinear Distance p-Median Problems