Polynomial-Time Solvers for the Discrete $\mathrm{\infty }$-Optimal Transport Problems

In this note, we propose polynomial-time algorithms solving the Monge and Kantorovich formulations of the $\mathrm{\infty }$-optimal transport problem in the discrete and finite setting. It is the first time, to the best of our knowledge, that efficient numerical methods for these problems have been proposed.