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)...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Cybernetics and systems analysis Ročník 51; číslo 5; s. 714 - 719
Hlavní autoři:	Mikhailyuk, V. A., Lishchuk, N. V.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.09.2015 Springer Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!