Pages that link to "Item:Q5954824"
From MaRDI portal
The following pages link to A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs (Q5954824):
Displayed 14 items.
- Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model (Q297075) (← links)
- Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs (Q613225) (← links)
- A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost (Q636547) (← links)
- Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model (Q1027595) (← links)
- Two new self-adaptive projection methods for variational inequality problems (Q1609083) (← links)
- Solving the combined modal split and traffic assignment problem with two types of transit impedance function (Q1752876) (← links)
- Non-additive shortest path in the context of traffic assignment (Q1754328) (← links)
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem (Q1761957) (← links)
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities (Q1887951) (← links)
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models (Q2029917) (← links)
- Modeling mode and route similarities in network equilibrium problem with go-green modes (Q2357861) (← links)
- Solving the dynamic user optimal assignment problem considering queue spillback (Q2379704) (← links)
- Applications of sensitivity analysis for probit stochastic network equilibrium (Q2433450) (← links)
- A power penalty method for the general traffic assignment problem with elastic demand (Q2438418) (← links)
