Comparative error bound theory for three location models: continuous demand versus discrete demand
From MaRDI portal
Publication:458944
DOI10.1007/s11750-011-0244-2zbMath1299.90224OpenAlexW2021898645MaRDI QIDQ458944
Timothy J. Lowe, Richard L. Francis
Publication date: 8 October 2014
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-011-0244-2
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On worst-case aggregation analysis for network location problems
- A continuous analysis framework for the solution of location-allocation problems with dense demand
- The general optimal market area model
- Location coverage models with demand originating from nodes and paths: Application to cellular network design
- Aggregation error for location models: Survey and analysis
- Locational optimization problems solved through Voronoi diagrams
- The Weber problem with regional demand
- The demand partitioning method for reducing aggregation errors in \(p\)-median problems
- A \(p\)-center grid-positioning aggregation procedure
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
- Aggregation and surrogation error in the \(p\)-median model
- A framework for demand point and solution space aggregation analysis for location models
- The minimum equitable radius location problem with continuous demand
- Continuous maximin knapsack problems with GLB constraints
- Reliable Facility Location Design Under the Risk of Disruptions
- Location Theory
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Probabilistic Analysis of Geometric Location Problems
- Medi-Centers of a Tree
- A Max-Min Allocation Problem: Its Solutions and Applications
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
- The Voronoi Partition of a Network and Its Implications in Location Theory
- Choosing the window width when estimating a density
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- The p-center location problem in an area
- Error-bound driven demand point aggregation for the rectilinear distance p-center model
- Replacing continuous demand with discrete demand in a competitive location model
- Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems
- Aggregation Error Bounds for a Class of Location Models
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- On Marginal Allocation in Single Constraint Min-Max Problems
- More on Min-Max Allocation
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Fast heuristics for large scale covering-location problems
