Pages that link to "Item:Q1367872"
From MaRDI portal
The following pages link to A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network (Q1367872):
Displaying 9 items.
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem (Q849087) (← links)
- A simplicial decomposition method for the transit equilibrium assignment problem (Q1308665) (← links)
- A survey of some mathematical programming models in transportation (Q1367685) (← links)
- Numerical solution procedures for the morning commute problem (Q2390158) (← links)
- A convergent and efficient decomposition method for the traffic assignment problem (Q2515069) (← links)
- Linearized simplicial decomposition methods for computing traffic equilibria on networks (Q3337182) (← links)
- Restricted simplicial decomposition: Computation and extensions (Q3777773) (← links)
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem (Q4004822) (← links)
- (Q5160453) (← links)