Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem (Q849087)
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 5674553
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem |
scientific article; zbMATH DE number 5674553 |
Statements
Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem (English)
0 references
24 February 2010
0 references
traffic assignment problem
0 references
variational inequalities
0 references
simplicial decomposition
0 references
analytic center cutting plane method
0 references
0 references
0 references
0 references
0 references
0 references
0.8838918805122375
0 references
0.8642067313194275
0 references
0.8621647953987122
0 references
0.8149364590644836
0 references
0.8109264373779297
0 references
