An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing
- 1 February 2004
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 27 (2) , 187-215
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- Multicommodity Capacitated Network Design1999
- An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow1998
- An exponential‐function reduction method for block‐angular convex programsNetworks, 1995
- Fast Approximation Algorithms for Multicommodity Flow ProblemsJournal of Computer and System Sciences, 1995
- Dual-ascent methods for large-scale multicommodity flow problemsNaval Research Logistics (NRL), 1993
- Multicommodity network flows—A surveyNetworks, 1978
- Solving multicommodity transportation problems using a primal partitioning simplex techniqueNaval Research Logistics Quarterly, 1977
- A generalized upper bounding approach to a communications network planning problemNetworks, 1977
- A Unified Approach to Equilibrium Methods for Traffic Assignment1976
- A generalized upper bounding algorithm for multicommodity network flow problemsNetworks, 1971