A compression method using path partitioning and SVD approximation, solved by adaptive augmented Lagrangian, reduces dimensionality in traffic assignment problems with preserved feasibility and high link-flow fidelity.
Prentice Hall, Englewood Cliffs, NJ
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Compressed Traffic Assignment with the Augmented Lagrangian Method
A compression method using path partitioning and SVD approximation, solved by adaptive augmented Lagrangian, reduces dimensionality in traffic assignment problems with preserved feasibility and high link-flow fidelity.