\addvspace {10\p@ }
\addvspace {10\p@ }
\contentsline {figure}{\numberline {2.1}{\ignorespaces A graphical representation for the recursive solution of the illustrative $4 \times 4$ linear assignment task presented in the text. The numbers immediately following colons are either entries or sums of entries in the data matrix $\@mathbf {C}$. Underlined numbers refer to the most recent addition to a subset}}{15}
\addvspace {10\p@ }
\addvspace {10\p@ }
\contentsline {figure}{\numberline {4.1}{\ignorespaces The optimal orders for the before and after matrices of Table 4.1 minimizing the sum of proximities between adjacently-placed objects.}}{76}
\contentsline {figure}{\numberline {4.2}{\ignorespaces An optimal circular ordering of the ten digits that minimizes the sum of proximities from Table 1.1 between adjacently-placed objects.}}{78}
\addvspace {10\p@ }
\addvspace {10\p@ }
\addvspace {10\p@ }