2 papers
cs.LG2021
Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison
Sylvain Courtain, Guillaume Guex, Ilkka Kivimaki +1
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest p…
cs.LG2019
Randomized Shortest Paths with Net Flows and Capacity Constraints
Sylvain Courtain, Pierre Leleux, Ilkka Kivimaki +2
This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and adding capacity constraints on edge flows. The standard RSP is a model of movement…