A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) (Q6113557)

From MaRDI portal
Revision as of 23:41, 27 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    11 July 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Euclidean Steiner tree problem
    0 references
    combinatorial optimization
    0 references
    heuristic
    0 references
    second-order cone programming
    0 references