An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397)
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: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem |
scientific article; zbMATH DE number 6386995
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem |
scientific article; zbMATH DE number 6386995 |
Statements
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (English)
0 references
15 January 2015
0 references
robust shortest path
0 references
uncertain data
0 references
heuristics
0 references
mathematical modeling
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8458479642868042
0 references
0.8341419696807861
0 references
0.8285532593727112
0 references
0.8192766904830933
0 references
0.8079771995544434
0 references
