Optimal Mass Transport on Metric Graphs

DOI10.1137/140995611zbMath1320.05134OpenAlexW1168826912MaRDI QIDQ2945123

No author found.

Publication date: 9 September 2015

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.723.8599

zbMATH Keywords

convex optimization\(p\)-Laplacianoptimal transportmetric graphs

Mathematics Subject Classification ID

Convex programming (90C25) Variational problems in a geometric measure-theoretic setting (49Q20) Graph theory (05C99) Existence theories in calculus of variations and optimal control (49J99)

Related Items (5)

An optimal matching problem with constraints ⋮ Gradient flow formulation of diffusion equations in the Wasserstein space over a metric graph ⋮ Aubry–Mather theory on graphs ⋮ Minimizing optimal transport for functions with fixed-size nodal sets ⋮ Dynamic Optimal Transport on Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Monge-Kantorovich mass transport problem for a discrete distance
• Spectral analysis on graph-like spaces
• Optimal transportation networks. Models and theory
• Optimal urban networks via mass transportation
• Mass transport problems for the Euclidean distance obtained as limits of \(p\)-Laplacian type problems with obstacles
• An optimal transportation problem with a cost given by the Euclidean distance plus import/export taxes on the boundary
• Dispersion for the Schrödinger equation on networks
• Mass transport problems obtained as limits of p-Laplacian type problems with spatial dependence
• Differential equations methods for the Monge-Kantorovich mass transfer problem
• Kirchhoff's rule for quantum wires
• An Optimal Matching Problem for the Euclidean Distance
• Quantum graphs: I. Some basic structures
• Optimal Transport

This page was built for publication: Optimal Mass Transport on Metric Graphs