A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909)
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 comparison of different routing schemes for the robust network loading problem: polyhedral results and computation |
scientific article; zbMATH DE number 6862309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation |
scientific article; zbMATH DE number 6862309 |
Statements
A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (English)
0 references
20 April 2018
0 references
robust network loading
0 references
budgeted uncertainty
0 references
Benders decomposition
0 references
static routing
0 references
volume routing
0 references
affine routing
0 references
dynamic routing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
