Kantorovich-Rubinstein distance minimization: application to location problems
From MaRDI portal
Publication:3296381
Recommendations
Cites work
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 3134565 (Why is no real title available?)
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems
- Approximating \(k\)-median via pseudo-approximation
- Approximations for Probability Distributions and Stochastic Optimization Problems
- CVaR distance between univariate probability distributions and approximation problems
- Capacitated \(k\)-center problem with vertex weights
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Measures of distance between probability distributions
- On k-Median clustering in high dimensions
- On the Weber facility location problem with limited distances and side constraints
- On the translocation of masses
- Supply chain optimization.
- The Kantorovich metric: the initial history and little-known applications
Cited in
(2)
This page was built for publication: Kantorovich-Rubinstein distance minimization: application to location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296381)