In this note, we propose polynomial-time algorithms solving the Monge and Kantorovich formulations of the $\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.

翻译：本文中，我们提出在离散有限设定下求解∞最优输运问题的Monge和Kantorovich形式的多项式时间算法。据我们所知，这是首次为这些问题提出高效的数值方法。