Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum (Q2460110)
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: Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum |
scientific article; zbMATH DE number 5211654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum |
scientific article; zbMATH DE number 5211654 |
Statements
Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum (English)
0 references
14 November 2007
0 references
Dynamic traffic assignment
0 references
Time-varying network flows
0 references
System optimum
0 references
0 references
0 references
0.8421288132667542
0 references
0.8189420104026794
0 references
0.8189418315887451
0 references
