A minmax regret version of the time-dependent shortest path problem (Q724002)
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 6910062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A minmax regret version of the time-dependent shortest path problem |
scientific article; zbMATH DE number 6910062 |
Statements
A minmax regret version of the time-dependent shortest path problem (English)
0 references
25 July 2018
0 references
integer programming
0 references
minmax-regret models
0 references
Benders decomposition
0 references
0 references
0 references
0 references
0 references
0.9170122
0 references
0.91447455
0 references
0.9026983
0 references
0.8917867
0 references
0 references
0.8862731
0 references
0.88315713
0 references
