Optimal transportation with constant constraint
In this paper, the authors consider optimal transportation problems with constraint, for which the upper bound \(h(x, y)\) of the density \(H\) on the product spaces is constant and \(h \geq 1\). They propose simplifications of proofs for many previous results and examples [\textit{J. Korman} et al., Calc. Var. Partial Differ. Equ. 54, No. 1, 573--584 (2015; Zbl 1331.90095); \textit{J. Korman} and \textit{R. J. McCann}, Trans. Am. Math. Soc. 367, No. 3, 1501--1521 (2015; Zbl 1305.90065)], and also present explicit examples of optimal transportation plans for all constraints \(h \geq 1\).
- Optimal transportation in \(\mathbb R^n\) for a distance cost with a convex constraint
- Optimal transportation with capacity constraints
- Limits of density-constrained optimal transport
- On a Kantorovich problem with a density constraint
- Two dimensional optimal transportation problem for a distance cost with a convex constraint
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- Dual potentials for capacity constrained optimal transport
- scientific article; zbMATH DE number 1022519 (Why is no real title available?)
- scientific article; zbMATH DE number 3099866 (Why is no real title available?)
- Optimal Transport
- Optimal transportation with capacity constraints
- Prékopa-Leindler type inequalities on Riemannian manifolds, Jacobi fields, and optimal transport
This page was built for publication: Optimal transportation with constant constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1639602)
