{
  "id": "1904.08246",
  "version": "v1",
  "published": "2019-04-17T12:55:32.000Z",
  "updated": "2019-04-17T12:55:32.000Z",
  "title": "The oriented mailing problem and its convex relaxation",
  "authors": [
    "Marcello Carioni",
    "Andrea Marchese",
    "Annalisa Massaccesi",
    "Alessandra Pluda",
    "Riccardo Tione"
  ],
  "categories": [
    "math.AP",
    "math.OC"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-04-17T12:55:32.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "convex relaxation",
      "oriented mailing problem",
      "optimal transportation networks",
      "steiner tree problem",
      "connectedness constraint"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}