An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem (Q1664248)
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: An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem |
scientific article; zbMATH DE number 6925027
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem |
scientific article; zbMATH DE number 6925027 |
Statements
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem (English)
0 references
24 August 2018
0 references
constrained shortest paths
0 references
shortest path algorithms
0 references
ranking best solutions
0 references
0 references
0 references
0.90657496
0 references
0.87089294
0 references
0.8635763
0 references
0.8619135
0 references
0.85876864
0 references
0.8554477
0 references
0.8539877
0 references
0.8520156
0 references
