S. Martello and P. Toth, “Knapsack Problems: Algorithms and Computer Implementation,” John Willey & Sons Ltd., Chichester, 1990.

has been cited by the following article:

• TITLE: Combined Algorithms of Optimal Resource Allocation

  AUTHORS: Valery I. Struchenkov

  KEYWORDS: Dynamic Programming; The Pareto Set; Branch and Bound Method; The Curse of Dimensionality; Algorithm “Descent-Ascent”

  JOURNAL NAME: Applied Mathematics, Vol.3 No.1, January 4, 2012

  ABSTRACT: Under study is the problem of optimum allocation of a resource. The following is proposed: the algorithm of dynamic programming in which on each step we only use the set of Pareto-optimal points, from which unpromising points are in addition excluded. For this purpose, initial approximations and bilateral prognostic evaluations of optimum are used. These evaluations are obtained by the method of branch and bound. A new algorithm “descent-ascent” is proposed to find upper and lower limits of the optimum. It repeatedly allows to increase the efficiency of the algorithm in the comparison with the well known methods. The results of calculations are included.