A note on the minimum instantaneous cost path of the dynamic traffic assignment problem (Q1908281)
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: A note on the minimum instantaneous cost path of the dynamic traffic assignment problem |
scientific article; zbMATH DE number 847647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the minimum instantaneous cost path of the dynamic traffic assignment problem |
scientific article; zbMATH DE number 847647 |
Statements
A note on the minimum instantaneous cost path of the dynamic traffic assignment problem (English)
0 references
6 August 1996
0 references
dynamic traffic assignment
0 references
route guidance
0 references
minimum instantaneous cost path principle
0 references
looping routes
0 references
0.8950906
0 references
0.8903026
0 references
0.88534224
0 references
0.88198483
0 references
0 references
0.8745884
0 references
0.8734674
0 references
