The Minmax Multidimensional Knapsack Problem with Application to a Chance-Constrained Problem
Kress, Moshe, Penn, Michal and Polukarov, Maria (2007) The Minmax Multidimensional Knapsack Problem with Application to a Chance-Constrained Problem. Naval Research Logistics, 54, (6), 656-666.
- Published Version
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.
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Agents, Interactions & Complexity
|Date Deposited:||16 Sep 2009 20:44|
|Last Modified:||21 Aug 2012 04:27|
|Contributors:||Kress, Moshe (Author)
Penn, Michal (Author)
Polukarov, Maria (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||2|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)