A Probabilistic Analysis of the K-Location Problem
From MaRDI portal
Recommendations
- A probabilistic analysis of the maximal covering location problem
- A probabilistic analysis of the capacitated facility location problem
- Probabilistic Analysis of Geometric Location Problems
- A facility location problem with equal amounts of production at random input data
- scientific article; zbMATH DE number 4102781
Cites work
- A Concentration Inequality for the K-Median Problem
- An analysis of approximations for maximizing submodular set functions—I
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- scientific article; zbMATH DE number 44961 (Why is no real title available?)
- scientific article; zbMATH DE number 3538576 (Why is no real title available?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Probabilistic Analysis of Geometric Location Problems
- Probabilistic Analysis of the Planar k-Median Problem
- Steinhaus's geometric location problem for random samples in the plane
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
- Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
Cited in
(7)- A probabilistic analysis of the capacitated facility location problem
- Probabilistic analysis of two \(k\)-cluster problems
- A probabilistic analysis of the maximal covering location problem
- On statistical bounds of heuristic solutions to location problems
- A stochastic location problem of k-centers on a graph
- scientific article; zbMATH DE number 2217290 (Why is no real title available?)
- Continuous approximation formulas for location problems
This page was built for publication: A Probabilistic Analysis of the K-Location Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136634)
