A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) (Q6113557): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q114221877, #quickstatements; #temporary_batch_1723488958199 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114221877 / rank | |||
Normal rank | |||
Revision as of 20:12, 12 August 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
0 references
0 references
0 references
0 references
0 references
0 references
