ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- 19 June 2007
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 120 (1) , 179-210
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problemComputational Optimization and Applications, 2007
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPMOperations Research, 2006
- A Conjugate Direction Frank-Wolfe Method with Applications to the Traffic Assignment Problem2003
- Origin-Based Algorithm for the Traffic Assignment ProblemTransportation Science, 2002
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow ProblemsINFORMS Journal on Computing, 1999
- Two-Metric Projection Methods for Constrained OptimizationSIAM Journal on Control and Optimization, 1984
- Projected Newton methods and optimization of multicommodity flowsIEEE Transactions on Automatic Control, 1983
- The flow deviation method: An approach to store‐and‐forward communication network designNetworks, 1973
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956