Time version of the shortest path problem in a stochastic-flow network (Q1019780): 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.cam.2008.09.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021785639 / rank | |||
Normal rank | |||
Revision as of 00:55, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time version of the shortest path problem in a stochastic-flow network |
scientific article |
Statements
Time version of the shortest path problem in a stochastic-flow network (English)
0 references
28 May 2009
0 references
shortest path
0 references
quickest path
0 references
two minimal paths
0 references
time constraint
0 references
stochastic-flow network
0 references
