Optimization Online


Exact Solution of the Robust Knapsack Problem

Michele Monaci(monaci***at***dei.unipd.it)
Ulrich Pferschy(pferschy***at***uni-graz.at)
Paolo Serafini(paolo.serafini***at***uniud.it)

Abstract: We consider an uncertain variant of the knapsack problem in which the weight of the items is not exactly known in advance, but belongs to a given interval, and an upper bound is imposed on the number of items whose weight di ffers from the expected one. For this problem, we provide a dynamic programming algorithm and present techniques aimed at reducing its space and time complexities. Finally, we computationally compare the performances of the proposed algorithm with those of di fferent exact algorithms presented so far in the literature for robust optimization problems.

Keywords: knapsack problem, robust optimization, dynamic programming

Category 1: Combinatorial Optimization

Category 2: Robust Optimization

Category 3: Other Topics (Dynamic Programming )


Download: [PDF]

Entry Submitted: 12/05/2012
Entry Accepted: 12/06/2012
Entry Last Modified: 12/05/2012

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society