Finding flow equilibrium with projective methods with decomposition and route generation
From MaRDI portal
Publication:2261748
DOI10.1134/S0005117912030125zbMath1307.90049OpenAlexW2171734485MaRDI QIDQ2261748
Publication date: 13 March 2015
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117912030125
Applications of optimal control and differential games (49N90) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Traffic problems in operations research (90B20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equilibrium models and variational inequalities.
- Algorithms for distributing traffic flows
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Equilibrium programming: Gradient methods
- An iterative algorithm for the variational inequality problem
- Combined relaxation methods for variational inequalities
- Mathematical modeling of traffic flows
- Some recent advances in projection-type methods for variational inequalities
- Network economics: a variational inequality approach
- Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
- Envelope stepsize control for iterative algorithms based on Fejer processes with attractants
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- Origin-Based Algorithm for the Traffic Assignment Problem
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Unified framework of extragradient-type methods for pseudomonotone variational inequalities.
This page was built for publication: Finding flow equilibrium with projective methods with decomposition and route generation
