Kataoka, Seiji; Yamada, Takeo - In: European Journal of Operational Research 237 (2014) 2, pp. 440-447
We formulate the multiple knapsack assignment problem (MKAP) as an extension of the multiple knapsack problem (MKP), as well as of the assignment problem. Except for small instances, MKAP is hard to solve to optimality. We present a heuristic algorithm to solve this problem approximately but...