Insight into the computation of Steiner minimal trees in Euclidean space of general dimension

DOI10.1016/j.dam.2019.03.015zbMath1483.90134OpenAlexW2935104118WikidataQ114191517 ScholiaQ114191517MaRDI QIDQ2064280

Márcia H. C. Fampa

Publication date: 5 January 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.03.015

zbMATH Keywords

Steiner minimal treeMINLPEuclidean Steiner problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (3)

Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\) ⋮ A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$ ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
• On the low-dimensional Steiner minimum tree problem in Hamming metric
• Using a conic formulation for finding Steiner minimal trees
• Orbital branching
• An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
• A linear time algorithm for full Steiner trees
• How to find Steiner minimal trees in Euclidean \(d\)-space
• The Steiner tree problem
• Pruning by isomorphism in branch-and-cut
• Rectilinear group Steiner trees and applications in VLSI design
• Exploiting orbits in symmetric ILP
• The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
• Virtuous smoothing for global optimization
• Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\)
• An overview of exact algorithms for the Euclidean Steiner tree problem inn-space
• Steiner Trees and 3-D Macromolecular Conformation
• Steiner Trees for Terminals Constrained to Curves
• On the Problem of Steiner
• An algorithm for the steiner problem in the euclidean plane
• The Complexity of Computing Steiner Minimal Trees
• Euclidean Steiner minimum trees: An improved exact algorithm
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
• Steiner Minimal Trees
• On the Steiner Problem

This page was built for publication: Insight into the computation of Steiner minimal trees in Euclidean space of general dimension