The first <i>K</i> minimum cost paths in a time-schedule network (Q4658384)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2146663
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The first <i>K</i> minimum cost paths in a time-schedule network |
scientific article; zbMATH DE number 2146663 |
Statements
The first <i>K</i> minimum cost paths in a time-schedule network (English)
0 references
16 March 2005
0 references
shortest path
0 references
road transport
0 references
networks and graphs
0 references
0.8829590082168579
0 references
0.8806193470954895
0 references
0.8649728894233704
0 references
0.8623876571655273
0 references
0.8320454359054565
0 references
