An algorithm for solving a class of knapsack problems and its generalization

Abstract

A class of knapsack problems which generalizes the classical ones is studied. Algorithms based on the dynamical programming and Branch and Bound methods are proposed. The correctness and time estimation of the algorithm are given.