Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics (Q865758): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disopt.2006.06.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISOPT.2006.06.002 / rank | |||
Normal rank | |||
Latest revision as of 06:05, 10 December 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
0 references
