An exact bidirectional \(A^\star\) approach for solving resource-constrained shortest path problems (Q3120784)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7038021
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact bidirectional \(A^\star\) approach for solving resource-constrained shortest path problems |
scientific article; zbMATH DE number 7038021 |
Statements
An exact bidirectional<i>A</i><sup>⋆</sup>approach for solving resource-constrained shortest path problems (English)
0 references
19 March 2019
0 references
bidirectional
0 references
Dijkstra
0 references
dynamic programming
0 references
heuristic search
0 references
resource constraints
0 references
shortest paths
0 references
0.7309831976890564
0 references
0.7222080826759338
0 references
0.6962649822235107
0 references
0.6899802088737488
0 references
0.6892502307891846
0 references
