A dual scheme for traffic assignment problems
DOI10.1080/02331939708844366zbMath0893.90055OpenAlexW2121676328MaRDI QIDQ4375434
Torbjörn Larsson, Michael Patriksson, Zhuangwei Liu
Publication date: 4 March 1998
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939708844366
subgradient optimizationFrank-Wolfe algorithmLagrangean dualizationsuccessive averagessymmetric traffic equilibrium assignment
Programming involving graphs or networks (90C35) Numerical methods involving duality (49M29) Transportation, logistics and supply chain management (90B06) Numerical methods based on nonlinear programming (49M37) Deterministic network models in operations research (90B10)
Related Items (6)
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
- Conditional subgradient optimization -- theory and applications
- Minimization of functions having Lipschitz continuous first partial derivatives
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
- Restricted simplicial decomposition: Computation and extensions
- An algorithm for the equilibrium assignment problem with random link times
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- Validation of subgradient optimization
- Minimization of unsmooth functionals
- Routing in computer networks
This page was built for publication: A dual scheme for traffic assignment problems