Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
Year of publication: |
2009
|
---|---|
Authors: | Rosas, Dulce ; Castro, Jordi ; Montero, Lídia |
Published in: |
Computational Optimization and Applications. - Springer. - Vol. 44.2009, 2, p. 289-313
|
Publisher: |
Springer |
Subject: | Traffic assignment problem | Variational inequalities | Simplicial decomposition | Analytic center cutting plane method |
-
Solving the multicommodity flow problem with the analytic center cutting plane method
Babonneau, Frédéric, (2006)
-
An analytic center cutting plane method to determine complete positivity of a matrix
Badenbroek, Riley, (2022)
-
On the stochastic network equilibrium with heterogeneous choice inertia
Xie, Chi, (2014)
- More ...
-
A combined and robust modal-split/traffic assignment model for rail and road freight transport
Rosell, Francisca, (2022)
-
Bartering integer commodities with exogenous prices
Nasini, Stefano, (2014)
-
Minimum-distance controlled perturbation methods for large-scale tabular data protection
Castro, Jordi, (2006)
- More ...