Comparative error bound theory for three location models: continuous demand versus discrete demand

DOI10.1007/S11750-011-0244-2MaRDI QIDQ458944zbMATH OpenOpenAlexFDO

Authors Richard L. Francis, Timothy J. Lowe

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

zbMATH Keywords

disaggregationaggregationlocationapproximationerror boundcovering\(p\)-center\(p\)-MedianVoronoi

Mathematics Subject Classification ID

Continuous location (90B85)

Recommendations

• Aggregation Error Bounds for a Class of Location Models
• New error bounds in continuous minisum location for aggregation at the gravity centre
• Aggregation error for location models: Survey and analysis
• Demand point aggregation for planar covering location models
• Replacing continuous demand with discrete demand in a competitive location model

Cites work

• scientific article; zbMATH DE number 3847184 (Why is no real title available?)
• scientific article; zbMATH DE number 9246 (Why is no real title available?)
• scientific article; zbMATH DE number 1253045 (Why is no real title available?)
• scientific article; zbMATH DE number 1253060 (Why is no real title available?)
• scientific article; zbMATH DE number 1302182 (Why is no real title available?)
• scientific article; zbMATH DE number 1323022 (Why is no real title available?)
• scientific article; zbMATH DE number 1076394 (Why is no real title available?)
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• scientific article; zbMATH DE number 4001209 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• scientific article; zbMATH DE number 3221579 (Why is no real title available?)
• A Max-Min Allocation Problem: Its Solutions and Applications
• A \(p\)-center grid-positioning aggregation procedure
• A continuous analysis framework for the solution of location-allocation problems with dense demand
• A framework for demand point and solution space aggregation analysis for location models
• Aggregation Error Bounds for a Class of Location Models
• Aggregation and Disaggregation Techniques and Methodology in Optimization
• Aggregation and surrogation error in the \(p\)-median model
• Aggregation error for location models: Survey and analysis
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Choosing the window width when estimating a density
• Continuous maximin knapsack problems with GLB constraints
• Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
• Error-bound driven demand point aggregation for the rectilinear distance p-center model
• Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems
• Fast heuristics for large scale covering-location problems
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• Location coverage models with demand originating from nodes and paths: Application to cellular network design
• Location theory. A unified approach
• Locational optimization problems solved through Voronoi diagrams
• Medi-Centers of a Tree
• More on Min-Max Allocation
• New error bounds in continuous minisum location for aggregation at the gravity centre
• On Marginal Allocation in Single Constraint Min-Max Problems
• On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
• On worst-case aggregation analysis for network location problems
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Probabilistic Analysis of Geometric Location Problems
• Reliable facility location design under the risk of disruptions
• Replacing continuous demand with discrete demand in a competitive location model
• The Voronoi Partition of a Network and Its Implications in Location Theory
• The Weber problem with regional demand
• The demand partitioning method for reducing aggregation errors in \(p\)-median problems
• The general optimal market area model
• The minimum equitable radius location problem with continuous demand
• The p-center location problem in an area

Cited in

(4)

• Aggregation Error Bounds for a Class of Location Models
• New error bounds in continuous minisum location for aggregation at the gravity centre
• Erratum to “A Continuous Model for Multistore Competitive Location”
• A parallelized lagrangean relaxation approach for the discrete ordered median problem

Describes a project that uses

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

This page was built for publication: Comparative error bound theory for three location models: continuous demand versus discrete demand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458944)