Demand point aggregation for location models
From MaRDI portal
Demand point aggregation methods for location models are considered. The authors point out that demand point aggregation causes error, and presented some possible error measurements. For the entire collection see [Zbl 0988.00044].
Cited in
(15)- Aggregation error for location models: Survey and analysis
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
- On price competition in location-price models with spatially separated makets
- Location analysis: a synthesis and survey
- Computation of multi-facility location Nash equilibria on a network under quantity competition
- Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- Estimating the Pareto front of a hard bi-criterion competitive facility location problem
- Error-bound driven demand point aggregation for the rectilinear distance p-center model
- Representative points for location-biased datasets
- Profit maximization and reduction of the cannibalization effect in chain expansion
- Improving solution of discrete competitive facility location problems
- Using error bounds to compare aggregated generalized transportation models
- Locating landfills--optimization vs. reality
- A discrete long-term location--price problem under the assumption of discriminatory pricing: formulations and parametric analysis
This page was built for publication: Demand point aggregation for location models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147662)