Title: Complexity results and exact algorithms for robust knapsack problems
Authors: Talla Nobibon, Fabrice # ×
Leus, Roel #
Issue Date: 2014
Publisher: Plenum Pub. Corp.
Series Title: Journal of Optimization Theory and Applications vol:161 issue:2 pages:533-552
Abstract: This paper studies the robust knapsack problem, for which solutions are, up to a certain point, immune from data uncertainty. We complement the works found in the literature, where uncertainty affects only the profits or only the weights of the items, by studying the complexity and approximation of the general setting with uncertainty regarding both the profits and the weights, for three different objective functions. Furthermore, we develop a scenario-relaxation algorithm for solving the general problem and present computational results.
ISSN: 0022-3239
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Research Center for Operations Research and Business Statistics (ORSTAT), Leuven
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
ComplexityResults.pdf Published 606KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science