Lozovanu, Dumitru2017-05-242017-05-242003LOZOVANU, 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-1681223-6934https://msuir.usm.md/handle/123456789/1161We 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.endynamic programming methodpacking knapsack problemk-optimal treeTHE PACKING KNAPSACK PROBLEM, AND THE K-OPTIMAL TREE IN A WEIGHTED DIGRAPHArticle