Kress, Moshe, Penn, Michal and Polukarov, Maria
The Minmax Multidimensional Knapsack Problem with Application to a Chance-Constrained Problem
Naval Research Logistics, 54, (6), .
In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two-period, two-level, chanced-constrained problem with recourse. We show that the MKP is NP-hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assumptions regarding the operational setting of the logistics problem, the chance-constrained optimization problem is decomposable into a series of MKPs that are solved separately.
Actions (login required)