A conjugate gradient projection algorithm for the traffic assignment problem (Q597403): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Goldstein-Levitin-Polyak gradient projection method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finiteness in restricted simplicial decomposition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Projected Newton methods and optimization of multicommodity flows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An approach to nonlinear programming / rank | |||
Normal rank | |||
Latest revision as of 19:04, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A conjugate gradient projection algorithm for the traffic assignment problem |
scientific article |
Statements
A conjugate gradient projection algorithm for the traffic assignment problem (English)
0 references
6 August 2004
0 references
Traffic assigment
0 references
Gradient projection
0 references
Conjugate gradient projection
0 references
Path-based algorithm
0 references
0 references
