Heterogeneous Multi-Resource Allocation with Subset Demand Requests

DOI10.1287/IJOC.2022.1204MaRDI QIDQ6392832arXivFDO

Authors Arden Baxter, Pinar Keskinocak, Mohit Singh

Publication date 4 March 2022

Published in arXiv

Full work available at URL https://doi.org/10.1287/IJOC.2022.1204

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

arXiv classification

math.OC

Abstract: 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.

This page was built for publication: Heterogeneous Multi-Resource Allocation with Subset Demand Requests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6392832)