On the complexity of postoptimality analysis of \(0/1\) programs (Q1283802)
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 postoptimality analysis of 0/1 programs |
scientific article; zbMATH DE number 1271077
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of postoptimality analysis of \(0/1\) programs |
scientific article; zbMATH DE number 1271077 |
Statements
On the complexity of postoptimality analysis of \(0/1\) programs (English)
0 references
5 August 1999
0 references
postoptimality analysis
0 references
\(\varepsilon\)-optimal solutions
0 references
NP-hard 0/1 problems
0 references
0.87378144
0 references
0.8737275
0 references
0.86584735
0 references
0.8644118
0 references
0 references
0.84358734
0 references
0.84081537
0 references
0.83889884
0 references
0.8377264
0 references
