Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources (Q4702334)

From MaRDI portal
Revision as of 00:47, 3 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1368661
Language Label Description Also known as
English
Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources
scientific article; zbMATH DE number 1368661

    Statements

    Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources (English)
    0 references
    0 references
    0 references
    0 references
    24 November 1999
    0 references
    minimum cost pipe network
    0 references
    generalized Steiner minimum tree problem
    0 references
    bounding theorem
    0 references
    backtrack
    0 references
    interior-point methods
    0 references
    k-optimal
    0 references
    communication networks
    0 references

    Identifiers