Algorithms for the quickest path problem and the enumeration of quickest paths (Q1184451): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum cost-reliability ratio path problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The quickest path problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974) / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(91)90063-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997102717 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the quickest path problem and the enumeration of quickest paths |
scientific article |
Statements
Algorithms for the quickest path problem and the enumeration of quickest paths (English)
0 references
28 June 1992
0 references
input network
0 references
routing path
0 references
minimum time
0 references
single pair quickest path problem
0 references
