# Insights into capacity constrained optimal transport

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

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Apr 2013.

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

- [Group-blind optimal transport to group parity and its constrained variants](https://mlsanity.com/paper/2310.11407/) (2023)
- [A Sinkhorn-type Algorithm for Constrained Optimal Transport](https://mlsanity.com/paper/2403.05054/) (2024)
- [Take It or Leave It: Intent-Controlled Partial Optimal Transport](https://mlsanity.com/paper/2605.20030/) (2026)

## Abstract (arXiv)

A variant of the classical optimal transportation problem is: among all joint measures with fixed marginals and which are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were established in citeKM11. In the present manuscript, we expose an unexpected symmetry leading to the first explicit examples in two and more dimensions. These are inspired in part by simulations in one dimension which display singularities and topology and in part by two further developments: the identification of all extreme points in the feasible set, and a new approach to uniqueness based on constructing feasible perturbations.