Authors: Lozovanu Dmitrii
, Elena Tataru, Alex Zelikovsky
We consider the packing knapsack problem which generalizes the classical knapsack problem. An algorithm of dynamical programming method for solving this problem and its application for finding the k-optimal tree in a weighted directed graph are proposed.
Institute of Mathematics
and Computer Science
Academy of Science of Moldova
Academiei str, 5, MD-2028 Chisinau