General approach to estimating the complexity of postoptimality analysis for discrete optimization problems

被引：3
|
作者：
Mikhailyuk V.A. [1 ]
机构：
[1] V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv
来源：
Cybernetics and Systems Analysis | 2010年 / 46卷 / 02期
关键词：
Polynomial algorithm; Polynomially solvable problem; Postoptimality analysis;
D O I：
10.1007/s10559-010-9206-1
中图分类号：
学科分类号：
摘要：
It is shown that there does not exist a polynomial algorithm to derive the optimal solution of a set cover problem that differs from the original problem in one position of the constraint matrix if the optimal solution of the original problem is known and P ≠ NP. A similar result holds for the knapsack problem. © 2010 Springer Science+Business Media, Inc.
引用
下载
收藏
页码：290 / 295
页数：5
相关论文
共 50 条
12345