J. Walker

发表

A branch and bound algorithm for solving the multiple-choice knapsack problem

M. E. Dyer, M. Dyer, N. Kayal, 1984 .

A hybrid dynamic programming/branch-and-bound algorithm for the multiple-choice knapsack problem

M. Dyer, W. Riha, J. Walker, 1995 .