Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints (Q1898910)
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: Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints |
scientific article |
Statements
Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints (English)
0 references
25 September 1995
0 references
route planning
0 references
artificial neural system
0 references
optimal path algorithm
0 references
