Transport networks serve critical functions in biological and engineered systems, and yet
their design requires trade-offs between competing objectives. Due to their sessile lifestyle …

Abstract The Euclidean Steiner tree problem (ESTP) in is to find a shortest network
interconnecting p given points in n‐dimensional Euclidean space. The problem was first …

We present a new exact algorithm for the Steiner tree problem in edge-weighted graphs. Our
algorithm improves the classical dynamic programming approach by Dreyfus and Wagner …

Biological systems have adapted to environmental constraints and limited resource
availability. In the present study, we evaluate the algorithm underlying leaf venation (LV) …

Steiner tree problems (STPs) are very important in both theory and practice. In this paper, we
introduce a powerful swap-vertex move operator which can be used as a basic element of …

We present well known properties related to the topology of Steiner minimal trees and to the
geometric position of Steiner points, and investigate their application in the exact algorithms …

The need for designing lighter and more compact systems often leaves limited space for
planning routes for the connectors that enable interactions among the system's components …

In this work, a new second‐order conic optimization model for the Euclidean Steiner tree
problem in d‐space, where the dimension d is at least three, will be presented. Also, two …

New mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in
d-space (with d ≥ 3 d≥ 3) will be presented in this work. All models feature a nonsmooth …

An approximate Steiner tree is a Steiner tree on a given set of terminals in Euclidean space
such that the angles at the Steiner points are within a specified error from 120^ ∘ 120∘. This …