Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics (Q865758)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics |
scientific article; zbMATH DE number 5128396
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics |
scientific article; zbMATH DE number 5128396 |
Statements
Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics (English)
0 references
20 February 2007
0 references
network design
0 references
algorithm
0 references
computational complexity
0 references
logistics
0 references
0 references
