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

From MaRDI portal
Revision as of 02:26, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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