Properties of the \(d\)-dimensional Earth mover's problem

DOI10.1016/j.dam.2019.02.042zbMath1461.90069OpenAlexW2923014300MaRDI QIDQ2312655

Jeffery Kline

Publication date: 17 July 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.02.042

zbMATH Keywords

linear programminggreedy algorithmsubmodularitytransportation problemconvex polytopesMonge property

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05)

Related Items (4)

Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands ⋮ Transportation Problem Allowing Sending and Bringing Back ⋮ A generalization for the expected value of the earth mover's distance ⋮ Transportation problem on a graph

Uses Software

• Stony Brook
• EMD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric applications of a matrix-searching algorithm
• Approximation of points of the convex hull of a sum of sets by points of the sum: an elementary approach
• A Monge property for the \(d\)-dimensional transportation problem
• The earth mover's distance as a metric for image retrieval
• Perspectives of Monge properties in optimization
• Monge properties, discrete convexity and applications
• Nonembeddability theorems via Fourier analysis
• A General Class of Greedily Solvable Linear Programs
• The Monge–Kantorovich Mass Transference Problem and Its Stochastic Applications
• Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
• All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
• The Distribution of a Product from Several Sources to Numerous Localities

This page was built for publication: Properties of the \(d\)-dimensional Earth mover's problem