Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints (Q2379538): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:41, 2 February 2024
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
