\(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems (Q951128)
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: -optimization schemes and L-bit precision: alternative perspectives for solving combinatorial optimization problems |
scientific article; zbMATH DE number 5358807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems |
scientific article; zbMATH DE number 5358807 |
Statements
\(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems (English)
0 references
29 October 2008
0 references
approximation schemes
0 references
combinatorial optimization
0 references
computational complexity
0 references
inverse optimization
0 references
0.9941142201423644
0 references
0.7243198752403259
0 references
0.7243198156356812
0 references
0.7038840055465698
0 references
