Through a series of theorems they show that the factorial coding problem can be accurately solved with a branch and bound search tree algorithm, or tightly approximated with a series of linear problems. In addition, they introduce a simple transformation (namely, order permutation) which provides a greedy yet very effective approximation of the optimal solution.
Through a series of logical arguments, they show that the factorial coding problem can be solved exactly using a branch and bound search tree algorithm or approximated closely through a set of linear problems. Moreover, they introduce a straightforward transformation (order permutation) that offers a greedy yet highly effective method for finding the optimal solution.