He developed the concepts used in the first practical algorithm for solving large knapsack problems and which are used in almost every efficient algorithm for this type of problem.
For the one-dimensional case, the new patterns are introduced by solving an auxiliary optimization problem called the knapsack problem, using dual variable information from the linear program.
