A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447)
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 new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem |
scientific article; zbMATH DE number 6633544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem |
scientific article; zbMATH DE number 6633544 |
Statements
A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (English)
0 references
6 October 2016
0 references
combinatorial optimization
0 references
minmax regret
0 references
robust optimization
0 references
approximation
0 references
robust shortest paths
0 references
0 references
0 references
0 references
0 references
0.8063057065010071
0 references
0.8013763427734375
0 references
0.7947267293930054
0 references
0.794276237487793
0 references
0.7896483540534973
0 references
