Discrete Resource Allocation by a Branch and Bound Method

A branch and bound method given by Shih for the solution of a class of discrete single resource allocation problems with concave return functions and several constraints of any type is extended to cover problems with arbitrary non-decreasing return functions.