Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
DOI10.1002/NET.3230180403zbMATH Open0652.90090OpenAlexW2014730390MaRDI QIDQ3798488FDOQ3798488
Authors: Ron S. Dembo, Ulrich Tulowitzki
Publication date: 1988
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230180403
Recommendations
- scientific article; zbMATH DE number 1059235
- A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
- scientific article; zbMATH DE number 1086906
- Computing Wardropian equilibria in a complementarity framework
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
rate of convergencecomputation of equilibrialarge-scale nonlinear optimizationsequence of quadratic programmingimprovement of asymptotic algorithm behaviorlarge multicommodity networkstraffic equilibrium calculations
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Programming involving graphs or networks (90C35) Nonlinear programming (90C30)
Cites Work
Cited In (6)
- Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
- A unified description of iterative algorithms for traffic equilibria
- Postoptimizing equilibrium flows on large scale networks
- Bilevel programming in traffic planning: Models, methods and challenge
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
This page was built for publication: Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798488)