The complexity of approximation reoptimization algorithms for discrete optimization (Q1797554)
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: The complexity of approximation reoptimization algorithms for discrete optimization |
scientific article; zbMATH DE number 6959809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of approximation reoptimization algorithms for discrete optimization |
scientific article; zbMATH DE number 6959809 |
Statements
The complexity of approximation reoptimization algorithms for discrete optimization (English)
0 references
22 October 2018
0 references
postoptimality analysis
0 references
approximation
0 references
discrete optimization
0 references
0.8051003813743591
0 references
0.7852298617362976
0 references
0.7814658880233765
0 references
0.7799648642539978
0 references
