Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints (Q2379538)
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 5685133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints |
scientific article; zbMATH DE number 5685133 |
Statements
Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints (English)
0 references
19 March 2010
0 references
quickest path
0 references
time threshold
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0.9222556948661804
0 references
0.9151198863983154
0 references
0.9072486758232116
0 references
0.9036739468574524
0 references
