A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization (Q2197476)
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: A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization |
scientific article; zbMATH DE number 7242124
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization |
scientific article; zbMATH DE number 7242124 |
Statements
A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization (English)
0 references
31 August 2020
0 references
robust combinatorial optimization
0 references
oracle-based algorithms
0 references
0 references
0.7715663313865662
0 references
0.7685651779174805
0 references
0.7649857997894287
0 references
0.7649856209754944
0 references
