Pages that link to "Item:Q1647911"
From MaRDI portal
The following pages link to Convex relaxation and variational approximation of the Steiner problem: theory and numerics (Q1647911):
Displaying 13 items.
- Using a conic formulation for finding Steiner minimal trees (Q596675) (← links)
- A variational approach to the Steiner network problem (Q810521) (← links)
- Convex relaxation and variational approximation of functionals defined on 1-dimensional connected sets (Q1730285) (← links)
- Numerical calibration of Steiner trees (Q1734283) (← links)
- A phase-field approximation of the Steiner problem in dimension two (Q1739065) (← links)
- On different notions of calibrations for minimal partitions and minimal networks in \(\mathbb{R}^2\) (Q2039531) (← links)
- The oriented mailing problem and its convex relaxation (Q2199974) (← links)
- Optimal synchronization problem for a multi-agent system (Q2396324) (← links)
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ (Q4546061) (← links)
- Calibrations for minimal networks in a covering space setting (Q5118957) (← links)
- A Multimaterial Transport Problem and its Convex Relaxation via Rectifiable $G$-currents (Q5231299) (← links)
- Numerical approximation of the Steiner problem in dimension $2$ and $3$ (Q5235091) (← links)
- On the solution of the generalized steiner problem by the subgradient method (Q5753761) (← links)
