On the complexity of calculating sensitivity parameters in Boolean programming problems (Q904419)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of calculating sensitivity parameters in Boolean programming problems |
scientific article |
Statements
On the complexity of calculating sensitivity parameters in Boolean programming problems (English)
0 references
13 January 2016
0 references
complexity of sensitivity analysis
0 references
stability radius of a problem
0 references
stability ball of radius \(r\) for an \(\epsilon\)-approximate problem solution
0 references
0 references
