Numerical enclosures of the optimal cost of the Kantorovitch's mass transportation problem
From MaRDI portal
Publication:263172
DOI10.1007/s10589-015-9794-9zbMath1364.90211OpenAlexW1827205382MaRDI QIDQ263172
Philippe Lucidarme, Nicolas Delanoue, Mehdi Lhommeau
Publication date: 4 April 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9794-9
Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (1)
Uses Software
Cites Work
- A class of Cartesian grid embedded boundary algorithms for incompressible flow with time-varying complex geometries
- New interval analysis support functions using gradient information in a global minimization algorithm
- Interval Newton iteration in multiple precision for the univariate case
- Bounds for error in the solution set of a perturbed linear program
- Numerical approximations to the mass transfer problem on compact spaces
- Duality and an Algorithm for a Class of Continuous Transportation Problems
- Numerical solutions of the mass transfer problem
- Polar factorization and monotone rearrangement of vector‐valued functions
- Interval Methods for Systems of Equations
- The Lorenz attractor exists
- Numerical resolution of an “unbalanced” mass transport problem
- Practical aspects of interval computation
- Optimal Transport
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Numerical enclosures of the optimal cost of the Kantorovitch's mass transportation problem