The maximum nearby flow problem

DOI10.1007/978-3-030-34960-8_3MaRDI QIDQ2215997zbMATH OpenOpenAlexFDO

Authors Gennaro Auricchio, Stefano Gualandi, Marco Veneroni

Publication date 15 December 2020

Full work available at URL https://doi.org/10.1007/978-3-030-34960-8_3

zbMATH Keywords

network simplexoptimal transportWasserstein distance

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Linear programming (90C05)

Recommendations

• On the computation of Kantorovich-Wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows
• Computing the Kantorovich distance for images
• Optimal Couplings of Kantorovich-Rubinstein-Wasserstein Lp-distance
• Multilevel optimal transport: a fast approximation of Wasserstein-1 distances
• A parallel method for earth mover's distance

Cited in

(4)

• scientific article; zbMATH DE number 6863577 (Why is no real title available?)
• Playing with the Maximum-Flow Problem
• The Maximum Flow Problem for Oriented Flows
• On the computation of the infinity Wasserstein distance and the Wasserstein projection problem

This page was built for publication: The maximum nearby flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215997)