From Kantorovitch Problem to Linear Sum Assignment Problem - Archive ouverte HAL Access content directly
Reports Year : 2021

From Kantorovitch Problem to Linear Sum Assignment Problem

(1)
1

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}
Fichier principal
Vignette du fichier
FromLSAPtoKantorovitch.pdf (197.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03388191 , version 1 (20-10-2021)
hal-03388191 , version 2 (08-11-2021)

Identifiers

  • HAL Id : hal-03388191 , version 2

Cite

Romain Raveaux. From Kantorovitch Problem to Linear Sum Assignment Problem. [Intern report] Université de tours. 2021. ⟨hal-03388191v2⟩
31 View
16 Download

Share

Gmail Facebook Twitter LinkedIn More