Kantorovich-Rubinstein distance minimization: application to location problems
From MaRDI portal
Publication:3296381
DOI10.1007/978-3-030-22788-3_3zbMATH Open1442.90119OpenAlexW2971530543MaRDI QIDQ3296381FDOQ3296381
Authors: Victor Kuzmenko, Stan Uryasev
Publication date: 7 July 2020
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-22788-3_3
Recommendations
Cites Work
- Title not available (Why is that?)
- The Kantorovich metric: the initial history and little-known applications
- Measures of distance between probability distributions
- On the translocation of masses
- Title not available (Why is that?)
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Approximations for Probability Distributions and Stochastic Optimization Problems
- Approximating \(k\)-median via pseudo-approximation
- On k-Median clustering in high dimensions
- Supply chain optimization.
- CVaR distance between univariate probability distributions and approximation problems
- On the Weber facility location problem with limited distances and side constraints
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems
- Capacitated k-Center Problem with Vertex Weights
Cited In (2)
Uses Software
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)