Convex optimization for binary tree-based transport networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2024

Convex optimization for binary tree-based transport networks

Abstract

Optimizing transport networks is a well-known class of problems that have been extensively studied, with application in many domains. Here we are interested in a generalization of the Steiner problem, which entails finding a graph minimizing a cost function associated with connecting a given set of points. In this paper, we concentrate on a specific formulation of this problem which is applied to the generation of synthetic vascular trees. More precisely, we focus on the Constrained Constructive Optimization (CCO) tree algorithm, which constructs a vascular network iteratively, optimizing a blood transport energy efficiency. We show that the classical incremental construction method often leads to sub-optimal results, and that a better global solution can be reached.
Fichier principal
Vignette du fichier
DGMM2024_paper_23.pdf (1.26 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04359833 , version 1 (21-12-2023)

Licence

Attribution

Identifiers

Cite

Raoul Sallé de Chou, Mohamed Ali Srir, Laurent Najman, Nicolas Passat, Hugues Talbot, et al.. Convex optimization for binary tree-based transport networks. International Conference on Discrete Geometry and Mathematical Morphology (DGMM), 2024, Florence, Italy. pp.217-228, ⟨10.1007/978-3-031-57793-2_17⟩. ⟨hal-04359833⟩
176 View
91 Download

Altmetric

Share

Gmail Facebook X LinkedIn More