Minimal cost linkages in graphs (Q1290153)

From MaRDI portal
Revision as of 02:48, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimal cost linkages in graphs
scientific article

    Statements

    title
    Minimal cost linkages in graphs (English)
    0 references
    author
    S. A. Harrison
    0 references
    V. J. Rayward-Smith
    0 references
    publication date
    10 June 1999
    0 references
    zbMATH Keywords
    minimal cost linkages
    0 references
    min-sum non-intersecting paths
    0 references
    min-max non-intersecting paths
    0 references
    NP-completeness
    0 references
    genetic algorithms
    0 references
    simulated annealing
    0 references

    Identifiers

    zbMATH DE Number
    1299352
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1290153&oldid=26119200"
    Powered by MediaWiki