Finding the first \(K\) shortest paths in a time-window network. (Q1427091): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0305-0548(02)00230-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023766747 / rank | |||
Normal rank | |||
Latest revision as of 09:46, 30 July 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
0 references
