The oriented mailing problem and its convex relaxation

DOI10.1016/J.NA.2020.112035MaRDI QIDQ2199974zbMATH OpenOpenAlexFDO

Authors Marcello Carioni, Andrea Marchese, Annalisa Massaccesi, Alessandra Pluda, Riccardo Tione

Publication date 14 September 2020

Published in Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

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

zbMATH Keywords

branched transportationcalibrationsmailing problemmulti-material transport problem

Mathematics Subject Classification ID

Geometric measure and integration theory, integral and normal currents in optimization (49Q15) Optimal transportation (49Q22) Calibrations and calibrated geometries (53C38) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Abstract: In this note we introduce a new model for the mailing problem in branched transportation in order to allow the cost functional to take into account the orientation of the moving particles. This gives an effective answer to [Problem 15.9] of the book "Optimal transportation networks" by Bernot, Caselles, and Morel. Moreover we define a convex relaxation in terms of rectifiable currents with group coefficients. With such approach we provide the problem with a notion of calibration. Using similar techniques we define a convex relaxation and a corresponding notion of calibration for a variant of the Steiner tree problem in which a connectedness constraint is assigned only among a certain partition of a given set of finitely many points.

Recommendations

• A convex approach to the Gilbert-Steiner problem
• Convex relaxation and variational approximation of the Steiner problem: theory and numerics
• Stability for the mailing problem
• A multimaterial transport problem and its convex relaxation via rectifiable G-currents
• Numerical calibration of Steiner trees

Cites work

• A multimaterial transport problem and its convex relaxation via rectifiable G-currents
• A variational model of irrigation patterns
• An application of optimal transport paths to urban transport networks
• An optimal irrigation network with infinitely many branching points
• Convex relaxation and variational approximation of the Steiner problem: theory and numerics
• General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary
• Improved stability of optimal traffic paths
• Numerical calibration of Steiner trees
• On the lower semicontinuous envelope of functionals defined on polyhedral chains
• Optimal channel networks, landscape function and branched transport
• OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
• Optimal transportation networks. Models and theory
• Optimal urban networks via mass transportation
• Stability for the mailing problem
• The Steiner tree problem revisited through rectifiable G-currents
• Variational approximation of functionals defined on 1-dimensional connected sets: the planar case

Cited in

(1)

• Stability for the mailing problem

This page was built for publication: The oriented mailing problem and its convex relaxation

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