Numerical methods for the problem of traffic flow equilibrium in the Beckmann and the stable dynamic models
From MaRDI portal
Publication:2969463
Recommendations
- Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks
- Universal method of searching for equilibria and stochastic equilibria in transportation networks
- Markovian traffic equilibrium
- Algorithms for computing traffic equilibria
- Traffic assignment: equilibrium models
Cited in
(10)- Algorithms for distributing traffic flows
- Multistage transportation model and sufficient conditions for its potentiality
- scientific article; zbMATH DE number 7726319 (Why is no real title available?)
- On the three-stage version of stable dynamic model
- Primal-Dual Gradient Methods for Searching Network Equilibria in Combined Models with Nested Choice Structure and Capacity Constraints
- Universal method of searching for equilibria and stochastic equilibria in transportation networks
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks
- Primal-dual mirror descent method for constraint stochastic optimization problems
- Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces
This page was built for publication: Numerical methods for the problem of traffic flow equilibrium in the Beckmann and the stable dynamic models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969463)
