A simplicial decomposition method for the transit equilibrium assignment problem

DOI10.1007/BF02072641zbMath0801.90042OpenAlexW2084186193MaRDI QIDQ1308665

Michael Florian, Jia Hao Wu

Publication date: 10 December 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

variational inequalitiessimplicial decompositiontransit equilibrium assignment

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Special types of economic equilibria (91B52) Variational inequalities (49J40) Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06)

Related Items (3)

Modified primal path-following scheme for the monotone variational inequality problem ⋮ Models and Software for Urban and Regional Transportation Planning: The Contributions of the Center for Research on Transportation ⋮ Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks

Cites Work

• Linearized simplicial decomposition methods for computing traffic equilibria on networks
• Convex quadratic programming with one constraint and bounded variables
• Projection methods for variational inequalities with application to the traffic assignment problem
• Iterative methods for variational and complementarity problems
• Validation of subgradient optimization
• Unnamed Item
• Unnamed Item

This page was built for publication: A simplicial decomposition method for the transit equilibrium assignment problem