Approximating the shortest path problem with scenarios (Q6652474)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7957619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the shortest path problem with scenarios |
scientific article; zbMATH DE number 7957619 |
Statements
Approximating the shortest path problem with scenarios (English)
0 references
12 December 2024
0 references
combinatorial optimization
0 references
approximation algorithm
0 references
robust optimization
0 references
shortest path problem
0 references
uncertainty
0 references
0 references
0 references
0 references
0.812178373336792
0 references
0.8044962882995605
0 references
0.7981156706809998
0 references
0.7909201979637146
0 references
0.7901046276092529
0 references
