From Kantorovitch Problem to Linear Sum Assignment Problem
Abstract
The goal of this technical report is to detail the link between the Linear Sum Assignment Problem (LSAP) and the Kantorovitch Problem (KP) also called Optimal Transport. This relation is not new and is reported in \cite{peyre2020computational}
Origin : Files produced by the author(s)