Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics (Q865758)

From MaRDI portal
Revision as of 13:44, 6 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
scientific article

    Statements

    Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    network design
    0 references
    algorithm
    0 references
    computational complexity
    0 references
    logistics
    0 references