Relative entropy-regularized optimal transport on a graph: a new algorithm and an experimental comparison

The present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into a set of input nodes and collected from a set of output nodes with specified ma...

Ausführliche Beschreibung