On the complexity of calculating sensitivity parameters in Boolean programming problems (Q904419)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of calculating sensitivity parameters in Boolean programming problems |
scientific article; zbMATH DE number 6529538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of calculating sensitivity parameters in Boolean programming problems |
scientific article; zbMATH DE number 6529538 |
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
0.7389306426048279
0 references
0.7387745976448059
0 references
