期刊
SIAM JOURNAL ON OPTIMIZATION
卷 23, 期 4, 页码 1956-1982出版社
SIAM PUBLICATIONS
DOI: 10.1137/120880355
关键词
knapsack problem; robust optimization; worst-case ratio
资金
- Austrian Science Fund (FWF) [P 23829-N13]
- Austrian Science Fund (FWF) [P 23829] Funding Source: researchfish
We consider an uncertain variant of the knapsack problem that arises when the exact weight of each item is not exactly known in advance but belongs to a given interval, and the number of items whose weight differs from the nominal value is bounded by a constant. We analyze the worsening of the optimal solution value with respect to the classical problem, and exactly determine its worst-case performance depending on uncertainty for all parameter configurations. We perform the same analysis for the fractional version of the problem in which one is allowed to pack any fraction of the items. In addition, we derive the worst-case performance ratio with respect to the optimal solution value, for both the fractional problem and for a variant of the well-known greedy algorithm. Finally, we consider a relevant special case and provide a combinatorial algorithm for solving the fractional problem in an efficient way.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据