THE PACKING KNAPSACK PROBLEM, AND THE K-OPTIMAL TREE IN A WEIGHTED DIGRAPH

Simple item page
dc.contributor.authorLozovanu, Dumitru
dc.date.accessioned2017-05-24T11:54:32Z
dc.date.available2017-05-24T11:54:32Z
dc.date.issued2003
dc.description.abstractWe consider the packing knapsack problem, which generalizes the classical knapsack problem. A dynamic programming algorithm for solving this problem and its applicationto find the k-optimal tree in a weighted directed graph are discussed.en
dc.identifier.citationLOZOVANU, D. The packing knapsack problem, and the k-optimal tree in a weighted digraph. In: Annals of University of Craiova, Math. Comp. Sci. Ser. 2003, Vol.30, pp. 162-168en
dc.identifier.issn1223-6934
dc.identifier.urihttps://msuir.usm.md/handle/123456789/1161
dc.language.isoenen
dc.subjectdynamic programming methoden
dc.subjectpacking knapsack problemen
dc.subjectk-optimal treeen
dc.titleTHE PACKING KNAPSACK PROBLEM, AND THE K-OPTIMAL TREE IN A WEIGHTED DIGRAPHen
dc.typeArticleen

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
114-114-1-PB.pdf
Size:
117.89 KB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

2. Articole