A partitioning algorithm for the multicommodity network flow problem
- 1 December 1972
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 3 (1) , 157-177
- https://doi.org/10.1007/bf01584987
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Dual Generalized Upper Bounding TechniqueManagement Science, 1971
- Elements of Large-Scale Mathematical Programming Part I: ConceptsManagement Science, 1970
- A decomposition method for structured linear and nonlinear programsJournal of Computer and System Sciences, 1969
- An operations research approach to racial desegregation of school systemsSocio-Economic Planning Sciences, 1968
- A Treatment of Transportation Problems by Primal Partition ProgrammingManagement Science, 1968
- SOLUTION TECHNIQUES FOR THE TRAFFIC ASSIGNMENT PROBLEMPublished by Defense Technical Information Center (DTIC) ,1965
- Multi-Commodity Network FlowsOperations Research, 1963
- The Decomposition Algorithm for Linear ProgramsEconometrica, 1961
- A Suggested Computation for Maximal Multi-Commodity Network FlowsManagement Science, 1958
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear ProgrammingEconometrica, 1955