A column generation and partitioning approach for multi-commodity flow problems
- 1 October 1994
- journal article
- Published by Springer Nature in Telecommunication Systems
- Vol. 3 (3) , 239-258
- https://doi.org/10.1007/bf02110307
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow ProblemsTransportation Science, 1993
- Dual-ascent methods for large-scale multicommodity flow problemsNaval Research Logistics (NRL), 1993
- Multicommodity Network Problems: Applications and ComputationsIIE Transactions, 1984
- Technical Note—Computational Comparison among Three Multicommodity Network Flow AlgorithmsOperations Research, 1980
- Multicommodity network flows—A surveyNetworks, 1978
- Steepest Ascent for Large Scale Linear ProgramsSIAM Review, 1972
- A generalized upper bounding algorithm for multicommodity network flow problemsNetworks, 1971
- Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable SystemsOperations Research, 1970
- Generalized upper bounding techniquesJournal of Computer and System Sciences, 1967
- Decomposition Principle for Linear ProgramsOperations Research, 1960