Solving the \(k\)-shortest path problem with time windows in a time varying network (Q2517796)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the \(k\)-shortest path problem with time windows in a time varying network |
scientific article |
Statements
Solving the \(k\)-shortest path problem with time windows in a time varying network (English)
0 references
9 January 2009
0 references
\(k\)-shortest path
0 references
routing and scheduling
0 references
dynamic programming
0 references
