An infeasibility pricing algorithm for the multicommodity minimum cost flow problem
References (25)
- et al.
A generalized chain labeling algorithm for solving large multicommodity flow problems
Comput. & Ops Res.
(1974) Primal resource-directive approaches for optimizing nonlinear decomposable systems
Ops Res.
(1970)Elements of large scale mathematical programming
Mgmt Science
(1970)Steepest ascent for large scale linear programs
SIAM Rev.
(1972)Optimization Theory for Large Systems
(1970)- et al.
A generalized upper bounding algorithm for multicommodity network flow problems
Networks
(1972) - et al.
An effective subgradient procedure for minimal cost multicommodity flow problems
Mgmt Science
(1977) Decomposition Algorithms for the Multicommodity Distribution Problem
- et al.
Decomposition principle for linear programs
Ops Res.
(1960) - et al.
Validation of subgradient optimization
Mathl Programming
(1974)
Minimization of unsmooth functionals
U.S.S.R., Computl Math. Matht Physics
(1969)
An infeasibility pricing decomposition method for linear programs
Ops Res.
(1966)
Cited by (0)
- ∗
Dr. Mokhtar S. Bazaraa is Professor of Industrial and Systems Engineering at the Georgia Institute of Technology. He received his BS in Mechanical Engineering from Cairo University and his MS and PhD from the Georgia Institute of Technology. His current interests include nonlinear and nonconvex programming. Dr. Bazaraa has consulted for many private and public organizations.
Copyright © 1978 Published by Elsevier Ltd.