A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network

DOI10.1007/BF02568510zbMath0887.90068OpenAlexW1991586378MaRDI QIDQ1367872

Bernhard Rupp

Publication date: 6 May 1998

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02568510

zbMATH Keywords

variational inequalitiesquadratic programmingprojection methodstraffic equilibriasimplicial decomposition methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Variational inequalities (49J40) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (2)

Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem ⋮ A survey of some mathematical programming models in transportation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A note on a globally convergent Newton method for solving monotone variational inequalities
• The gap function of a convex program
• A combined penalty function and gradient projection method for nonlinear programming
• Shortest-path algorithms: Taxonomy and annotation
• Linearized simplicial decomposition methods for computing traffic equilibria on networks
• Nonlinear cost network models in transportation analysis
• Adaptation of a Modified Newton Method for Solving the Asymmetric Traffic Equilibrium Problem
• Projection methods for variational inequalities with application to the traffic assignment problem
• Iterative methods for variational and complementarity problems
• Equilibria on a Congested Transportation Network
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• Simplicial decomposition in nonlinear programming algorithms
• An iterative scheme for variational inequalities
• An extension of the frank and Wolfe method of feasible directions

This page was built for publication: A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network