Error-bound driven demand point aggregation for the rectilinear distance p-center model
From MaRDI portal
Publication:4228765
Recommendations
- Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems
- Demand point aggregation for planar covering location models
- The \(p\)-center problem under locational uncertainty of demand points
- Worst-case analysis of demand point aggregation for the Euclidean p-median problem
- scientific article; zbMATH DE number 1076394
- A framework for demand point and solution space aggregation analysis for location models
- scientific article; zbMATH DE number 1803760
- The demand partitioning method for reducing aggregation errors in p-median problems
- Error bound comparisons for aggregation/disaggregation techniques applied to the transportation problem
- Minimax regret p-center location on a network with demand uncertainty
Cited in
(9)- Geographical information systems and location science
- Estimating demand with distance functions: parameterization in the primal and dual
- On solving large instances of the capacitated facility location problem
- Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems
- Comparative error bound theory for three location models: continuous demand versus discrete demand
- Aggregation error for location models: Survey and analysis
- Demand point aggregation for planar covering location models
- Aggregation in hub location problems
- A framework for demand point and solution space aggregation analysis for location models
This page was built for publication: Error-bound driven demand point aggregation for the rectilinear distance p-center model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228765)
