Special cases of the Multiple Knapsack Assignment Problem are studied. The problem is motivated by an emergency situation (i.e., a hurricane or flood). A polynomial time algorithm is developed for a special case of the problem. More general versions are shown to be NP-hard and heuristics are developed.