On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows

DOI10.1137/19M1261195zbMath1450.90008arXiv1804.00445MaRDI QIDQ5124004

Stefano Gualandi, Marco Veneroni, Federico Bassetti

Publication date: 17 September 2020

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.00445

zbMATH Keywords

transportation problem; Wasserstein distance; Kantorovich metric; network simplex; uncapacitated minimum cost flow problem

Mathematics Subject Classification ID

90C06: Large-scale problems in mathematical programming

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

Uses Software

• EMD
• SIFT
• DOTmark
• Wasserstein GAN