Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics (Q865758): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:12, 30 January 2024
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
20 February 2007
0 references
network design
0 references
algorithm
0 references
computational complexity
0 references
logistics
0 references
