Postoptimizing equilibrium flows on large scale networks
From MaRDI portal
Publication:1278241
DOI10.1016/0377-2217(94)00351-3zbMath0924.90064OpenAlexW1968140482MaRDI QIDQ1278241
D. Inaudi, Sang Nguyen, Stefano Pallottino
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00351-3
Related Items (2)
Applications of sensitivity analysis for probit stochastic network equilibrium ⋮ A demand model with departure time choice for within-day dynamic traffic assignment
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equilibrium traffic assignment for large scale transit networks
- A Full Analytical Implementation of the PARTAN/Frank–Wolfe Algorithm for Equilibrium Assignment
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
- Restricted simplicial decomposition: Computation and extensions
- An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem
- Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
- Projection methods for variational inequalities with application to the traffic assignment problem
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- Dynamic Estimators of Origin-Destination Matrices Using Traffic Counts
This page was built for publication: Postoptimizing equilibrium flows on large scale networks
