Page
%P
-
Article
A hybrid dynamic programming method for concave resource allocation problems
Concave resource allocation problem is an integer programming problem of minimizing a nonincreasing concave function subject to a convex nondecreasing constraint and bounded integer variables. This class of pr...