arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1904.08246math.APmath.OC
收藏

有向邮寄问题及其凸松弛

The oriented mailing problem and its convex relaxation

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

摘要:

在这篇文章中,我们介绍了一个新的模型的邮寄问题的分支运输,以使成本功能考虑到移动粒子的方向。这给出了Bernot,Caselles,and Morel的《最优运输网络》一书中[问题15.9]的有效答案。此外,我们定义了一个凸松弛的整流电流与群系数。通过这种方法,我们提供了一个校准的概念的问题。使用类似的技术,我们定义了一个凸松弛和相应的概念校准的一个变种的斯坦纳树问题,其中的连通性约束只分配在一个特定的分区的一组给定的多个点。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑