A network decomposition/aggregation procedure for a class of multicommodity transportation problems
- 1 June 1983
- Vol. 13 (2), 197-205
- https://doi.org/10.1002/net.3230130205
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Aggregation in the generalized transportation problemComputers & Operations Research, 1979
- Technical Note—A Single-Commodity Transformation for Certain Multicommodity NetworksOperations Research, 1978
- Graphic matroids and the multicommodity transportation problemMathematical Programming, 1977
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment AlgorithmsManagement Science, 1977
- A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problemMathematical Programming, 1976
- Multicommodity Distribution System Design by Benders DecompositionManagement Science, 1974
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974
- A partitioning algorithm for the multicommodity network flow problemMathematical Programming, 1972
- A generalized upper bounding algorithm for multicommodity network flow problemsNetworks, 1971
- Solution of Large-Scale Transportation Problems Through AggregationOperations Research, 1965