  We consider the problem of allocating multiple heterogeneous resources
geographically and over time to meet demands that require some subset of the
available resource types simultaneously at a specified time, location, and
duration. The objective is to maximize the total reward accrued from meeting (a
subset of) demands. We model this problem as an integer program, show that it
is NP-hard, and analyze the complexity of various special cases. We introduce
approximation algorithms and an extension to our problem that considers travel
costs. Finally, we test the performance of the integer programming model in an
extensive computational study.
