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

From MaRDI portal
Revision as of 20:12, 12 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q114221877, #quickstatements; #temporary_batch_1723488958199)
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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references