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

Lozovanu, Dumitru

dc.contributor.author	Lozovanu, Dumitru
dc.date.accessioned	2017-05-24T11:54:32Z
dc.date.available	2017-05-24T11:54:32Z
dc.date.issued	2003
dc.identifier.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	en
dc.identifier.issn	1223-6934
dc.identifier.uri	http://dspace.usm.md:8080/xmlui/handle/123456789/1161
dc.description.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.	en
dc.language.iso	en	en
dc.subject	dynamic programming method	en
dc.subject	packing knapsack problem	en
dc.subject	k-optimal tree	en
dc.title	THE PACKING KNAPSACK PROBLEM, AND THE K-OPTIMAL TREE IN A WEIGHTED DIGRAPH	en
dc.type	Article	en