The University of Southampton
University of Southampton Institutional Repository

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.

Record type: Article


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.

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

More information

Published date: 2007
Organisations: Agents, Interactions & Complexity


Local EPrints ID: 267886
PURE UUID: 291b2532-6036-4d3c-8ceb-6723a10b734c

Catalogue record

Date deposited: 16 Sep 2009 20:44
Last modified: 18 Jul 2017 06:58

Export record


Author: Moshe Kress
Author: Michal Penn
Author: Maria Polukarov

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.