Equilibria on a Congested Transportation Network
From MaRDI portal
Cites work
- A New Family of Probability Distributions With Applications to Monte Carlo Studies
- A minimum-cost multicommodity network flow problem concerning imports and exports
- A unification of the existence theorems of the nonlinear complementarity problem
- The complementarity problem
- The computation of fixed points and applications
- The nonlinear complementarity problem with applications. II
- Traffic assignment problem for a general network
Cited in
(45)- The uniqueness property for networks with several origin-destination pairs
- Asymmetric variational inequality problems over product sets: Applications and iterative methods
- Multiperiod competitive supply chain networks with inventorying and a transportation network equilibrium reformulation
- A power penalty method for the general traffic assignment problem with elastic demand
- A unified description of iterative algorithms for traffic equilibria
- New results on the existence of open loop Nash equilibria in discrete time dynamic games via generalized Nash games
- Tensor complementarity problems. III: Applications
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- Equilibria for networks with malicious users
- A model and genetic algorithm for area-wide intersection signal optimization under user equilibrium traffic
- A mean-risk model for the traffic assignment problem with stochastic travel times
- Decomposition algorithm for convex differentiable minimization
- A complementary formulation for traffic equilibrium problem with a new nonadditive route cost
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- On the existence of optimal taxes for network congestion games with heterogeneous users
- An interdependent multi-layer model: resilience of international networks
- A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
- Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium
- A solution condition for complementarity problems: With an application to spatial price equilibrium
- Competition among providers in loss networks
- Bilevel programming in traffic planning: Models, methods and challenge
- An existence condition for open set nonlinear complementarity problems with an application to a closed economic system
- Edge pricing of multicommodity networks for selfish users with elastic demands
- A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions
- Computing Wardropian equilibria in a complementarity framework
- Stochastic nonlinear complementarity problem and applications to traffic equilibrium under uncertainty
- Stackelberg strategies for selfish routing in general multicommodity networks
- Dynamic equilibria in transport systems
- Disequilibrium and variational inequalities
- Comparisons of urban travel forecasts prepared with the sequential procedure and a combined model
- Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models
- Equilibrium routing under uncertainty
- Stochastic ridesharing user equilibrium in transport networks
- Dynamic traffic assignment: Considerations on some deterministic modelling approaches
- Coalitions in nonatomic network congestion games
- An NE/SQP method for the bounded nonlinear complementarity problem
- Network design problem with congestion effects: A case of bilevel programming
- Benders decomposition for variational inequalities
- On the robustness of global optima and stationary solutions to stochastic mathematical programs with equilibrium constraints. II: Applications
- A Finsler geometrical programming approach to the nonlinear complementarity problem of traffic equilibrium
- A variable-dimension homotopy on networks for computing linear spatial equilibria
- Equilibria in Multiclass and Multidimensional Atomic Congestion Games
- The convergence conditions of diagonalization and projection methods for fixed demand asymmetric network equilibrium problems
- An iterative scheme for variational inequalities
This page was built for publication: Equilibria on a Congested Transportation Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967332)
