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 this page instead for the normal view: Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints |
scientific article |
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
