Search Results for author:
Found 2 papers, 0 papers with code
Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison
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 paths formalism.
Randomized Shortest Paths with Net Flows and Capacity Constraints
The framework assumes a unit flow injected into a source node and collected from a target node with flows minimizing the expected transportation cost, together with a relative entropy regularization term.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
