Kantorovich–Rubinstein Distance Minimization: Application to Location Problems

DOI10.1007/978-3-030-22788-3_3zbMath1442.90119OpenAlexW2971530543MaRDI QIDQ3296381

Stan Uryasev, Victor Kuzmenko

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

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Uses Software

• Matlab
• Portfolio Safeguard
• PSG

Cites Work

• Unnamed Item
• Unnamed Item
• Measures of distance between probability distributions
• CVaR distance between univariate probability distributions and approximation problems
• A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems
• On the Weber facility location problem with limited distances and side constraints
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• The Kantorovich metric: the initial history and little-known applications
• Supply chain optimization.
• On the Translocation of Masses
• Approximating $k$-Median via Pseudo-Approximation
• On k-Median clustering in high dimensions
• Approximations for Probability Distributions and Stochastic Optimization Problems
• Capacitated k-Center Problem with Vertex Weights

This page was built for publication: Kantorovich–Rubinstein Distance Minimization: Application to Location Problems