A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167)

From MaRDI portal
Revision as of 14:06, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
scientific article

    Statements

    A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (English)
    0 references
    0 references
    0 references
    0 references
    26 September 2016
    0 references
    Euclidean Steiner tree problem
    0 references
    mixed integer nonlinear programming
    0 references
    branch-and-bound
    0 references
    isomorphism pruning
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers