Finding the first \(K\) shortest paths in a time-window network. (Q1427091): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q323382 |
||
| Property / author | |||
| Property / author: Yen-Liang Chen / rank | |||
Revision as of 23:43, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the first \(K\) shortest paths in a time-window network. |
scientific article |
Statements
Finding the first \(K\) shortest paths in a time-window network. (English)
0 references
14 March 2004
0 references
Network
0 references
Time-window constraint
0 references
Shortest path
0 references
Simple path
0 references
