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

Thumbnail Image

Files

114-114-1-PB.pdf (117.89 KB)

Date

2003

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

We 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.

Description

Keywords

dynamic programming method, packing knapsack problem, k-optimal tree

Citation

LOZOVANU, 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-168

URI

https://msuir.usm.md/handle/123456789/1161

Collections

2. Articole

Endorsement

Review

Supplemented By

Referenced By