The convergence conditions of diagonalization and projection methods for fixed demand asymmetric network equilibrium problems
DOI10.1016/0167-6377(86)90088-XzbMath0603.90053OpenAlexW2040869498MaRDI QIDQ1083021
Clermont Dupuis, Jean-Marc Darveau
Publication date: 1986
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(86)90088-x
convergencevariational inequalityprojection methodsdiagonalizationtraffic equilibriumasymmetric user costsfixed demand user optimized network equilibrium problems
Numerical optimization and variational techniques (65K10) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Cites Work
- Unnamed Item
- Unnamed Item
- Finiteness in restricted simplicial decomposition
- Methodes itératives pour les équations et inéquations aux dérivées partielles non linéaires de type monotone. (Iteration methods for nonlinear equations and inequations with partial derivatives of monotone type)
- Projection methods for variational inequalities with application to the traffic assignment problem
- Equilibria on a Congested Transportation Network
- An iterative scheme for variational inequalities
This page was built for publication: The convergence conditions of diagonalization and projection methods for fixed demand asymmetric network equilibrium problems
