A Combinatorial Algorithm

2. It is obvious that if the pattern formed by those elements which are the least in their respective rows is such that it is possible to choose from among these elements (hereinafter to be called row-minima) a set containing one from each column and one from each row, then, such a set yields a minimum sum; moreover, that only sums consisting of rowminima will belong to the set. (Thus for example in the pattern