A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
An algorithm for solving a class of knapsack problems and its generalization
2005
Computer Science Journal of Moldova
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.
doaj:ef312f3883854e90a7052f5227758ec6
fatcat:qcdjdznnwbfqdm7lfbvywis4ey