Article ID Journal Published Year Pages File Type
4959779 European Journal of Operational Research 2017 5 Pages PDF
Abstract
The Multiple Knapsack Assignment Problem (MKAP) has been solved successfully using heuristics, but important special cases have not yet been dealt with. Motivated by an emergency relocation problem, an optimal polynomial algorithm and a high performing heuristic that take advantage of the special structure are provided for two special cases of the MKAP.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
Emergency relocation of items using single trips: Special cases of the Multiple Knapsack Assignment Problem
Authors
, , , ,