On the Complexity of Calculating Sensitivity Parameters in Boolean Programming Problems

This article shows that, for NP-hard problems, the calculation of even the stability ball of radius 1 for an optimal solution is computationally intensive (i.e., a suitable polynomial algorithm is absent when P ≠ NP). In using greedy algorithms for solving the set covering problem (knapsack problem)...

Full description

Saved in:

Bibliographic Details
Published in:	Cybernetics and systems analysis Vol. 51; no. 5; pp. 714 - 719
Main Authors:	Mikhailyuk, V. A., Lishchuk, N. V.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2015 Springer Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Boolean Computer programming Computer science Control Cybernetics Exercise equipment Integer programming Knapsack problem Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Optimization Parameter sensitivity Polynomials Processor Architectures Sensitivity analysis Software Engineering/Programming and Operating Systems Stability Studies Systems Theory complexity of sensitivity analysis stability radius of a problem stability ball of radius r for an ε-approximate problem solution
ISSN:	1060-0396, 1573-8337
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!