Again, though, we are interested in practical performance.
the first of these, termed the Greedy method, is a straightforward steepest-descent algorithm which employs incremental MML calculation to optimise a PtA.