Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions (Q2829166)
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: Iterated local search algorithms for the Euclidean Steiner tree problem in n dimensions |
scientific article; zbMATH DE number 6644388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions |
scientific article; zbMATH DE number 6644388 |
Statements
27 October 2016
0 references
Euclidean Steiner problem
0 references
ILS
0 references
metaheuristics
0 references
0 references
0 references
0 references
Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions (English)
0 references
0.877629280090332
0 references
0.8619240522384644
0 references
0.8470969200134277
0 references
0.8405168056488037
0 references
