A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) (Q6113557): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11750-022-00642-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4294723941 / rank | |||
Normal rank | |||
Revision as of 08:36, 30 July 2024
scientific article; zbMATH DE number 7709965
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) |
scientific article; zbMATH DE number 7709965 |
Statements
A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) (English)
0 references
11 July 2023
0 references
Euclidean Steiner tree problem
0 references
combinatorial optimization
0 references
heuristic
0 references
second-order cone programming
0 references
