Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios (Q1751178)
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: Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios |
scientific article; zbMATH DE number 6872100
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios |
scientific article; zbMATH DE number 6872100 |
Statements
Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios (English)
0 references
24 May 2018
0 references
robust shortest path
0 references
discrete scenarios
0 references
dynamic preprocessing
0 references
