This article presents a branch and bound method for solving the problem of minimizing a separable concave function over a convex polyhedral set where the variables are restricted to be integer valued. Computational results are reported.
No takes yet. Share an insight, caveat, or question.
Cabot et al. (1986) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: