Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints (Q2379538): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2008.12.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047112290 / rank | |||
Normal rank | |||
Revision as of 20:13, 19 March 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
