Hartman, J. K.; Lasdon, L. S. A generalized upper bounding algorithm for multicommodity network flow problems. (English) Zbl 0253.90030 Networks 1, 333-354 (1972). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 14 Documents MSC: 90C05 Linear programming 90C35 Programming involving graphs or networks × Cite Format Result Cite Review PDF Full Text: DOI References: [1] and , Programming, Games, and Transportation Networks, John Wiley & Sons, New York, 1965. [2] Linear Programming and Extensions, Princeton University Press, 1963. · Zbl 0108.33103 [3] ”Multi-Commodity Network Solutions,” ORC 66–23, Operations Research Center, University of California, Berkeley, 1966. [4] ”An Extension of Generalized Upper Bounded Techniques for Linear Programs,” ORC 65–27, Operations Research Center, University of California, Berkeley, 1965. [5] Optimization Theory for Large Systems, Macmillan Company, New York, 1970. [6] ”Multicommodity Flows in Directed Networks,” ORC 67–38, Operations Research Center, University of California, Berkeley, 1967. This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.