An algorithm is given for constructing an alphabetic binary tree of minimum weighted path length (for short, an optimal alphabetic tree). The algorithm needs 4n 2 + 2n operations and 4n storage ...

This paper presents the algorithm "DETMAX" whose purpose is to construct experimental designs that are "D-optimal." These are designs for which the determinant of X′X is maximum, where X is the ...