| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4618331 | Journal of Mathematical Analysis and Applications | 2011 | 21 Pages |
Abstract
We consider the Monge transportation problem when the cost is the squared geodesic distance around a convex obstacle. We show that there exists at least one—and in general infinitely many—optimal transport maps.
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
