This paper presents a "branch and bound" algorithm for the following problem: given a project consisting of a set of activities partially ordered by a set of precedence restrictions, with each ...

In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide ...