An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125)

From MaRDI portal
Revision as of 09:37, 10 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
An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
scientific article

    Statements

    title
    An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (English)
    0 references
    author
    Kurt M. Anstreicher
    0 references
    Márcia H. C. Fampa
    0 references
    publication date
    29 October 2008
    0 references
    zbMATH Keywords
    Euclidean Steiner problem
    0 references
    strong branching
    0 references
    describes a project that uses
    OR-Library
    0 references
    Mosek
    0 references
    FindSteinerTree
    0 references

    Identifiers

    zbMATH DE Number
    5358805
    0 references
    OpenAlex ID
    W1989550031
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q951125&oldid=38548392"
    Powered by MediaWiki