A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Mosek / rank | |||
Normal rank | |||
Revision as of 17:23, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space |
scientific article |
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
