Top-percentile traffic routing problem by dynamic programming (Q2443403)
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 6280332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Top-percentile traffic routing problem by dynamic programming |
scientific article; zbMATH DE number 6280332 |
Statements
Top-percentile traffic routing problem by dynamic programming (English)
0 references
7 April 2014
0 references
top-percentile
0 references
multi-homing
0 references
mixed-integer stochastic programming problem
0 references
dynamic programming
0 references
0.922538161277771
0 references
0.8622643947601318
0 references
0.827674150466919
0 references
0.817518413066864
0 references
0.7625076174736023
0 references
