In addition, two algorithms are presented for approximately solving fractional programming (FP) problems. The first algorithm is based on an objective space cut and bound method for solving convex FP ...

Operations Research, Vol. 33, No. 4 (Jul. - Aug., 1985), pp. 803-819 (17 pages) We present methods that are useful in solving some large scale hierarchical planning models involving 0-1 variables.