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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have