An equilibrium dynamic traffic assignment model with linear programming formulation
From MaRDI portal
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites work
- CVXPY: a Python-embedded modeling language for convex optimization
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 2096642 (Why is no real title available?)
- Multicommodity network flows: A survey. II: Solution methods
- Numerical solution procedures for the morning commute problem
- Parallelizing the dual revised simplex method
- Primal-Dual Gradient Methods for Searching Network Equilibria in Combined Models with Nested Choice Structure and Capacity Constraints
- Some consistency conditions for dynamic traffic assignment problems
This page was built for publication: An equilibrium dynamic traffic assignment model with linear programming formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965358)