Local Matching Indicators for Transport Problems with Concave Costs
From MaRDI portal
Publication:2910951
DOI10.1137/110823304zbMath1251.90272arXiv1102.1795OpenAlexW2043123754MaRDI QIDQ2910951
Julie Delon, Julien Salomon, Andrei N. Sobolevskiĭ
Publication date: 12 September 2012
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.1795
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (7)
Utility/privacy trade-off as regularized optimal transport ⋮ On a Solution to the Monge Transport Problem on the Real Line Arising from the Strictly Concave Case ⋮ Minimum-weight perfect matching for nonintrinsic distances on the line ⋮ Local matching indicators for concave transport costs ⋮ Sampled Gromov Wasserstein ⋮ The Dyck bound in the concave 1-dimensional random assignment model ⋮ Full characterization of optimal transport plans for concave costs
This page was built for publication: Local Matching Indicators for Transport Problems with Concave Costs
