Complexity Results and Exact Algorithms for Robust Knapsack Problems
Fabrice Talla Nobibon () and
Roel Leus
Additional contact information
Fabrice Talla Nobibon: PostDoc researcher for Research Foundation—Flanders
Roel Leus: KU Leuven
Journal of Optimization Theory and Applications, 2014, vol. 161, issue 2, No 11, 533-552
Abstract:
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.
Keywords: Knapsack problem; Robustness; Scenario-relaxation algorithm; NP-hardness; Approximation (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
http://link.springer.com/10.1007/s10957-013-0319-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:161:y:2014:i:2:d:10.1007_s10957-013-0319-3
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-013-0319-3
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().