On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems (Q4829385)
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 determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems |
scientific article; zbMATH DE number 2120086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems |
scientific article; zbMATH DE number 2120086 |
Statements
On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems (English)
0 references
29 November 2004
0 references
complexity
0 references
sensitivity analysis
0 references
min-max
0 references
0-1 combinatorial optimization problems
0 references
0.8397053480148315
0 references
0.7848706841468811
0 references
0.7812643647193909
0 references
0.780571460723877
0 references
