Local matching indicators for transport problems with concave costs
From MaRDI portal
Abstract: In this paper, we introduce a class of indicators that enable to compute efficiently optimal transport plans associated to arbitrary distributions of N demands and M supplies in R in the case where the cost function is concave. The computational cost of these indicators is small and independent of N. A hierarchical use of them enables to obtain an efficient algorithm.
Recommendations
- Local matching indicators for concave transport costs
- Exact solutions to the transportation problem on the line
- Fast transport optimization for Monge costs on the circle
- An algorithm for solving the transport problem on network with concave cost functions of flow on edges
- The geometry of optimal transportation
Cited in
(8)- Minimum-weight perfect matching for nonintrinsic distances on the line
- Sampled Gromov Wasserstein
- Full characterization of optimal transport plans for concave costs
- On a solution to the Monge transport problem on the real line arising from the strictly concave case
- The Dyck bound in the concave 1-dimensional random assignment model
- Utility/privacy trade-off as regularized optimal transport
- Greedy matching in optimal transport with concave cost
- Local matching indicators for concave transport costs
This page was built for publication: Local matching indicators for transport problems with concave costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910951)
