There it was shown how the difficulty of the enormous number of columns occurring in the linear programming formulation could be overcome by solving a knapsack problem at every pivot step.