A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
type: Item
instance of: scholarly article
title: A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
zbMATH Open document ID: 1353.90165
author: Jon Lee
author: Wendel Melo
author: Marcia Fampa
published in: Computational Optimization and Applications
publication date: 2016-09-26T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6629780
zbMATH Keywords: Euclidean Steiner tree problem
zbMATH Keywords: mixed integer nonlinear programming
zbMATH Keywords: branch-and-bound
zbMATH Keywords: isomorphism pruning
describes a project that uses: nauty
describes a project that uses: OR-Library
describes a project that uses: Mosek
describes a project that uses: Bonmin
MaRDI profile type: Publication
full work available at URL: s10589-016-9835-z
OpenAlex ID: W2284604408
cites work: Q4091421
cites work: How to find Steiner minimal trees in Euclidean \(d\)-space
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: An algorithmic framework for convex mixed integer nonlinear programs
cites work: The Complexity of Computing Steiner Minimal Trees
cites work: The Steiner tree problem
cites work: The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
cites work: Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
cites work: Orbital branching
cites work: Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\)
cites work: Q4945796
cites work: Euclidean Steiner minimum trees: An improved exact algorithm
DOI: 10.1007/S10589-016-9835-Z
description: scientific article; zbMATH DE number 6629780