Published Paper
AI statement: 🟢 AI-Free: no AI used.
Inserted: 19 apr 2016
Last Updated: 13 nov 2026
Journal: Appl. Math. Optim.
Year: 2016
Abstract:
In this paper we propose a variational approach to the Steiner tree problem, which is based on calibrations in a suitable algebraic environment for polyhedral chains which represent our candidates. This approach turns out to be very efficient from numerical point of view and allows to establish whether a given Steiner tree is optimal. Several examples are provided.
Download: