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 条

[21] An introduction to multi-parameter complexity analysis of discrete problems
Sevastianov, SV
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (02) : 387 - 397
[22] A hybrid continuous-discrete approach to large discrete structural optimization problems
Blachowski, Bartlomiej
Gutkowski, Witold
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2010, 41 (06) : 965 - 977
[23] A hybrid continuous-discrete approach to large discrete structural optimization problems
Bartlomiej Blachowski
Witold Gutkowski
Structural and Multidisciplinary Optimization, 2010, 41 : 965 - 977
[24] THE COMPLEXITY OF OPTIMIZATION PROBLEMS
KRENTEL, MW
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 36 (03) : 490 - 509
[25] Studying the complexity of global verification for NP-hard discrete optimization problems
Armstrong, DE
Jacobson, SH
JOURNAL OF GLOBAL OPTIMIZATION, 2003, 27 (01) : 83 - 96
[26] Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems
Derek E. Armstrong
Sheldon H. Jacobson
Journal of Global Optimization, 2003, 27 : 83 - 96
[27] Certain block problems of discrete optimization. I. A general approach to forming decomposition solution schemes
Sergeev, SI
AUTOMATION AND REMOTE CONTROL, 2000, 61 (08) : 1328 - 1343
[28] A neurodynamic approach to convex optimization problems with general constraint
Qin, Sitian
Liu, Yadong
Xue, Xiaoping
Wang, Fuqiang
NEURAL NETWORKS, 2016, 84 : 113 - 124
[29] DISCRETE OPTIMIZATION PROBLEMS
EMELICHE.VA
DOKLADY AKADEMII NAUK SSSR, 1970, 192 (05): : 1002 - &
[30] ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH
Adelshin, A. V.
Kolokolov, A. A.
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2015, 30 (04): : 100 - 108

← 1 2 3 4 5 →