Finding the first \(K\) shortest paths in a time-window network. (Q1427091)
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: Finding the first \(K\) shortest paths in a time-window network. |
scientific article; zbMATH DE number 2055439
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the first \(K\) shortest paths in a time-window network. |
scientific article; zbMATH DE number 2055439 |
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
0 references
