# Monge-Kantorovich interpolation with constraints and application to a parking problem

arXiv: https://arxiv.org/abs/2207.14261 · HTML: https://mlsanity.com/paper/2207.14261/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Jul 2022.

## Built on by (most cited first, 1 of 1)

- [Fast Optimal Transport through Sliced Wasserstein Generalized Geodesics](https://mlsanity.com/paper/2307.01770/) (2023)

## Abstract (arXiv)

We consider optimal transport problems where the cost for transporting a given probability measure μ0 to another one μ1 consists of two parts: the first one measures the transportation from μ0 to an intermediate (pivot) measure μ to be determined (and subject to various constraints), and the second one measures the transportation from μ to μ1. This leads to Monge-Kantorovich interpolation problems under constraints for which we establish various properties of the optimal pivot measures μ. Considering the more general situation where only some part of the mass uses the intermediate stop leads to a mathematical model for the optimal location of a parking region around a city. Numerical simulations, based on entropic regularization, are presented both for the optimal parking regions and for Monge-Kantorovich constrained interpolation problems.