On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems (Q466348)
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 estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems |
scientific article; zbMATH DE number 6361625
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems |
scientific article; zbMATH DE number 6361625 |
Statements
On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems (English)
0 references
27 October 2014
0 references
postoptimality analysis
0 references
complexity of the branch and bound method
0 references
completely unimodular matrix
0 references
0.8649722337722778
0 references
0.831317663192749
0 references
0.8259708881378174
0 references
0.7986380457878113
0 references
