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

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.