A dynamic programming algorithm for solving the \(k\)-color shortest path problem (Q2047192)
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: A dynamic programming algorithm for solving the \(k\)-color shortest path problem |
scientific article; zbMATH DE number 7383560
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dynamic programming algorithm for solving the \(k\)-color shortest path problem |
scientific article; zbMATH DE number 7383560 |
Statements
A dynamic programming algorithm for solving the \(k\)-color shortest path problem (English)
0 references
19 August 2021
0 references
edge-colored network
0 references
constrained shortest path
0 references
dynamic programming
0 references
network optimization
0 references
