Row-Column Aggregation for Rectilinear Distance p-Median Problems
From MaRDI portal
Publication:5689806
DOI10.1287/trsc.30.2.160zbMath0865.90087MaRDI 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
rectilinear distance; institutional location problems; large-scale \(p\)-median problems; median-row-column aggregation algorithm
90B80: Discrete location and assignment
Related Items
Worst-case incremental analysis for a class ofp-facility location problems, Geographical information systems and location science, Demand point aggregation for planar covering location models, The \(K\)-connection location problem in a plane, Aggregation in hub location problems, On solving large instances of the capacitated facility location problem, Aggregation error for location models: Survey and analysis, Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem, On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre, Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem