Sensitivity analysis for knapsack problems: A negative result

被引：0

作者：

机构：

来源：

Discrete Appl Math | / 1-3卷 / 133-139期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We show that, for any pair of knapsack problems, there is a single problem whose optimal solution corresponds to each problem of the pair, for two adjacent right-hand sides.

引用

共 50 条

[1] Sensitivity analysis for knapsack problems: A negative result
Blair, C
DISCRETE APPLIED MATHEMATICS, 1998, 81 (1-3) : 133 - 139
[2] Sensitivity analysis for knapsack problems: another negative result
Woeginger, GJ
DISCRETE APPLIED MATHEMATICS, 1999, 92 (2-3) : 247 - 251
[3] SENSITIVITY ANALYSIS OF THE KNAPSACK PROBLEM: A NEGATIVE RESULT
Mikhailyuk, V. A.
Lishchuk, N. V.
CYBERNETICS AND SYSTEMS ANALYSIS, 2013, 49 (02) : 201 - 204
[4] Sensitivity analysis of the knapsack problem: an improved result
Belgacem, Tarik
Hifi, Mhand
2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2006, : 934 - 939
[5] Sensitivity analysis of a greedy heuristic for knapsack problems
Ghosh, D
Chakravarti, N
Sierksma, G
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 169 (01) : 340 - 350
[6] Knapsack problems
Xue, J
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (11) : 1346 - 1347
[7] A relation between the knapsack and group knapsack problems
Zhu, N
DISCRETE APPLIED MATHEMATICS, 1998, 87 (1-3) : 255 - 268
[8] Tolerance analysis for 0-1 knapsack problems
Pisinger, David
Saidi, Alima
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 258 (03) : 866 - 876
[9] Knapsack problems with setups
Michel, S.
Perrot, N.
Vanderbeck, F.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 196 (03) : 909 - 918
[10] FRACTIONAL KNAPSACK PROBLEMS
ISHII, H
IBARAKI, T
MINE, H
MATHEMATICAL PROGRAMMING, 1977, 13 (03) : 255 - 271

← 1 2 3 4 5 →