A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167)
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: A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space |
scientific article; zbMATH DE number 6629780
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space |
scientific article; zbMATH DE number 6629780 |
Statements
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (English)
0 references
26 September 2016
0 references
Euclidean Steiner tree problem
0 references
mixed integer nonlinear programming
0 references
branch-and-bound
0 references
isomorphism pruning
0 references
0 references
0 references
