Probabilistic Analysis of Geometric Location Problems

DOI10.1137/0606017zbMath0569.90022OpenAlexW2017720756MaRDI QIDQ3686393

Eitan Zemel

Publication date: 1985

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0606017

zbMATH Keywords

heuristicsapproximationprobabilistic analysisgeometric locationAsymptotically optimal algorithmsmultiple facilities locationprobabilistic k median problem

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items

Rates of convergence for the empirical quantization error, A framework for demand point and solution space aggregation analysis for location models, Probabilistic Analysis of a Vehicle Routing Problem with Time Windows, A space-indexed formulation of packing boxes into a larger box, On vehicle placement to intercept moving targets, Comparative error bound theory for three location models: continuous demand versus discrete demand, Exploiting Packing Components in General-Purpose Integer Programming Solvers, Aggregation error for location models: Survey and analysis, Heuristic methods and applications: A categorized survey, On the k-center problem with many centers, Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem, A Probabilistic Analysis of the K-Location Problem, Demand point aggregation for planar covering location models, Probabilistic analysis of two \(k\)-cluster problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subadditive Euclidean functionals and nonlinear growth in geometric probability
• Covering space by spheres
• The Covering Of Space By Spheres
• Covering space with equal spheres
• Probabilistic Analysis of the Planar k-Median Problem
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Sum of moments of convex polygons
• Probabilistic Analysis of Network Flow Algorithms
• The Number of Circles Covering a Set