Solving multicommodity transportation problems using a primal partitioning simplex technique
- 1 June 1977
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 24 (2) , 309-325
- https://doi.org/10.1002/nav.3800240210
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A generalized chain labelling algorithm for solving multicommodity flow problemsComputers & Operations Research, 1974
- Validation of subgradient optimizationMathematical Programming, 1974
- Efficient computational devices for the capacitated transportation problemNaval Research Logistics Quarterly, 1974
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation AlgorithmJournal of the ACM, 1973
- A partitioning algorithm for the multicommodity network flow problemMathematical Programming, 1972
- A generalized upper bounding algorithm for multicommodity network flow problemsNetworks, 1971
- Multicommodity networks with resource constraints: The generalized multicommodity flow problemNetworks, 1971
- A generalized upper bounding method for doubly coupled linear programsNaval Research Logistics Quarterly, 1970
- Optimal multicommodity network flows with resource allocationNaval Research Logistics Quarterly, 1970
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961