Login / Signup
On the Computation of Kantorovich-Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows.
Federico Bassetti
Stefano Gualandi
Marco Veneroni
Published in:
SIAM J. Optim. (2020)
Keyphrases
</>
minimum cost
capacity constraints
network flow problem
approximation algorithms
np hard
network flow
spanning tree
network design problem
lot sizing
facility location problem
dissimilarity measure
multistage
minimal cost
distance measure
location problems
network simplex algorithm
evolutionary algorithm
np complete