A power penalty method for the general traffic assignment problem with elastic demand
From MaRDI portal
Publication:2438418
DOI10.3934/jimo.2014.10.1019zbMath1292.90295OpenAlexW2005212146MaRDI QIDQ2438418
Publication date: 11 March 2014
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2014.10.1019
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Related Items
A penalty approach to a discretized double obstacle problem with derivative constraints, A finite difference method for pricing European and American options under a geometric Lévy process, An unconstrained differentiable penalty method for implicit complementarity problems
Cites Work
- Pricing American options under proportional transaction costs using a penalty approach and a finite difference scheme
- A penalty method for a mixed nonlinear complementarity problem
- A power penalty method for linear complementarity problems
- A power penalty method for solving a nonlinear parabolic complementarity problem
- A power penalty approach to American option pricing with jump diffusion processes
- A new implementation of Yen's ranking loopless paths algorithm
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Solving nonadditive traffic assignment problems: a self-adaptive projection-auxiliary problem method for variational inequalities
- A power penalty approach to a nonlinear complementarity problem
- Power penalty method for a linear complementarity problem arising from American option valuation
- Equilibria on a Congested Transportation Network
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs