Heterogeneous Multi-resource Allocation with Subset Demand Requests
研究了在时间、地理位置上分配多种异构资源以满足同时需要多种资源类型的需求，目标是最大化总收益，通过整数规划建模并证明NP难，提出近似算法并测试性能。
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.