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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 07:19, 10 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
    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