An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125): 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 18:35, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space |
scientific article |
Statements
An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (English)
0 references
29 October 2008
0 references
Euclidean Steiner problem
0 references
strong branching
0 references
