Postoptimizing equilibrium flows on large scale networks
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3959083
- Optimal Flows in Stochastic Dynamic Networks with Congestion
- scientific article; zbMATH DE number 934458
- Quasi-variational equilibrium models for network flow problems
- Existence of optima and equilibria for traffic flow on networks
- scientific article; zbMATH DE number 3961334
- Optimal flows in dynamic networks and algorithms for their finding
- scientific article; zbMATH DE number 60122
- On large scale nonlinear network optimization
- scientific article; zbMATH DE number 3982887
Cites work
- scientific article; zbMATH DE number 3965791 (Why is no real title available?)
- scientific article; zbMATH DE number 3965792 (Why is no real title available?)
- scientific article; zbMATH DE number 3543771 (Why is no real title available?)
- A Full Analytical Implementation of the PARTAN/Frank–Wolfe Algorithm for Equilibrium Assignment
- 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
- Dynamic Estimators of Origin-Destination Matrices Using Traffic Counts
- Equilibrium traffic assignment for large scale transit networks
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
- Projection methods for variational inequalities with application to the traffic assignment problem
- Restricted simplicial decomposition: Computation and extensions
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
Cited in
(3)
This page was built for publication: Postoptimizing equilibrium flows on large scale networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278241)
