Optimal transportation networks as free Dirichlet for the Monge-Kantorovich problem
From MaRDI portal
Publication:5489507
Recommendations
Cites work
- scientific article; zbMATH DE number 3128000 (Why is no real title available?)
- scientific article; zbMATH DE number 499496 (Why is no real title available?)
- scientific article; zbMATH DE number 1996419 (Why is no real title available?)
- scientific article; zbMATH DE number 2043480 (Why is no real title available?)
- scientific article; zbMATH DE number 1766602 (Why is no real title available?)
- scientific article; zbMATH DE number 1448982 (Why is no real title available?)
- Characterization of optimal shapes and masses through Monge-Kantorovich equation
- Constructing optimal maps for Monge's transport problem as a limit of strictly convex costs
- On Regularity of Transport Density in the Monge--Kantorovich Problem
Cited in
(34)- Connecting measures by means of branched transportation networks at finite cost
- Partial regularity for the optimal \(p\)-compliance problem with length penalization
- Optimal transportation networks. Models and theory
- scientific article; zbMATH DE number 1996419 (Why is no real title available?)
- Blow-up of optimal sets in the irrigation problem
- Regularity of densities in relaxed and penalized average distance problem
- Partial geometric regularity of some optimal connected transportation networks
- Transport density in Monge-Kantorovich problems with Dirichlet conditions
- One-dimensional approximation of measures in Wasserstein distance
- The average-distance problem with an Euler elastica penalization
- Optimal networks for mass transportation problems
- A minimaxmax problem for improving the torsional stability of rectangular plates
- Average-distance problem for parameterized curves
- Regularity for the planar optimal \(p\)-compliance problem
- On principal curves with a length constraint
- Counterexample to regularity in average-distance problem
- On the horseshoe conjecture for maximal distance minimizers
- Long-term planningversusshort-term planning in the asymptotical location problem
- Where best to place a Dirichlet condition in an anisotropic membrane?
- Minimizers of the prescribed curvature functional in a Jordan domain with no necks
- Approximation of length minimization problems among compact connected sets
- Existence and regularity results for the Steiner problem
- Average-distance problem with curvature penalization for data parameterization: regularity of minimizers
- Dirichlet conditions in Poincaré-Sobolev inequalities: the sub-homogeneous case
- A variational model for urban planning with traffic congestion
- Shape optimization problems in control form
- A presentation of the average distance minimizing problem
- Regularity for the optimal compliance problem with length penalization
- A fractal shape optimization problem in branched transport
- Optimal design of sensors via geometric criteria
- On one-dimensional continua uniformly approximating planar sets
- The average distance problem with perimeter-to-area ratio penalization
- Multiple penalized principal curves: analysis and computation
- Optimal one-dimensional structures for the principal eigenvalue of two-dimensional domains
This page was built for publication: Optimal transportation networks as free Dirichlet for the Monge-Kantorovich problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5489507)