Pages that link to "Item:Q1308665"
From MaRDI portal
The following pages link to A simplicial decomposition method for the transit equilibrium assignment problem (Q1308665):
Displaying 10 items.
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem (Q849087) (← links)
- A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network (Q1367872) (← links)
- Modified primal path-following scheme for the monotone variational inequality problem (Q1372549) (← links)
- Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks (Q1869511) (← links)
- A convergent and efficient decomposition method for the traffic assignment problem (Q2515069) (← links)
- (Q3177267) (← links)
- Linearized simplicial decomposition methods for computing traffic equilibria on networks (Q3337182) (← links)
- Transit Equilibrium Assignment: A Model and Solution Algorithms (Q4319310) (← links)
- The Modulo Network Simplex with Integrated Passenger Routing (Q4596525) (← links)
- Models and Software for Urban and Regional Transportation Planning: The Contributions of the Center for Research on Transportation (Q6160340) (← links)