The first algorithm is based on an objective space cut and bound method for solving convex FP problems and the second algorithm is based on the proposed bi-objective algorithm for solving nonlinear FP ...

M. D. Hendy, Applications of a Continued Fraction Algorithm to Some Class Number Problems, Mathematics of Computation, Vol. 28, No. 125 (Jan., 1974), pp. 267-277 ...

In a fraction of the run time required by DETMAX, the sequential algorithm finds a design with a relative D-efficiency of 46.4009 / 46.4922 = 99.8% compared to the best design found by the DETMAX ...