An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space (Q2827758)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space |
scientific article; zbMATH DE number 6641862
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space |
scientific article; zbMATH DE number 6641862 |
Statements
21 October 2016
0 references
Euclidean Steiner tree problem
0 references
\(n\)-dimensional Euclidean space
0 references
exact algorithm
0 references
mixed-integer nonlinear programming
0 references
global optimization
0 references
0 references
0 references
An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space (English)
0 references
