An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems (Q464980)
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: An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems |
scientific article; zbMATH DE number 6362614
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems |
scientific article; zbMATH DE number 6362614 |
Statements
An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems (English)
0 references
30 October 2014
0 references
postoptimality analysis
0 references
polynomiality on average with respect to \(\mu\)
0 references
0 references
0.9033150672912598
0 references
0.8708829879760742
0 references
0.831317663192749
0 references
0.7768881320953369
0 references
