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), pp. 656-666.

Download

[img] PDF Published.pdf - Version of Record
Download (140kB)

Description/Abstract

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.

Item Type: Article
Organisations: Agents, Interactions & Complexity
ePrint ID: 267886
Date :
Date Event
2007Published
Date Deposited: 16 Sep 2009 20:44
Last Modified: 17 Apr 2017 18:40
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/267886

Actions (login required)

View Item View Item