Computing Wardropian equilibria in a complementarity framework
From MaRDI portal
Recommendations
Cites work
- A class of smoothing functions for nonlinear and mixed complementarity problems
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems
- Equilibria on a Congested Transportation Network
- Global Convergence of Damped Newton's Method for Nonsmooth Equations via the Path Search
- scientific article; zbMATH DE number 3515612 (Why is no real title available?)
- Projection methods for variational inequalities with application to the traffic assignment problem
Cited in
(14)- A note on the existence of traffic equilibria
- Complementarity problems in GAMS and the PATH solver
- A general equilibrium framework for integrated assessment of transport and economic impacts
- Algorithms for computing traffic equilibria
- Optimal detection of critical nodes: improvements to model structure and performance
- Tensor complementarity problems. III: Applications
- An anisotropic continuum model for traffic assignment in mixed transportation networks
- Optimal K-node disruption on a node-capacitated network
- Path flow estimator in an entropy model using a nonlinear L-shaped algorithm
- A percentile system optimization approach with and without path enumeration
- A hierarchical optimization problem: estimating traffic flow using gamma random variables in a Bayesian context
- Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
- Multicommodity network flows: a survey. I: Applications and formulations
- Computing all Wardrop equilibria parametrized by the flow demand
This page was built for publication: Computing Wardropian equilibria in a complementarity framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4704690)