On some techniques useful for solution of transportation network problems. (English) Zbl 0253.90015


90B10 Deterministic network models in operations research
90C35 Programming involving graphs or networks
Full Text: DOI


[1] Dijkstra, Numerische Mathematik 1 pp 269– (1959)
[2] Dreyfus, Operations Research 17 pp 395– (1969)
[3] and , ”Flows in Networks,” Princeton University Press, Princeton, N. J., 1962.
[4] ”Integer Programming and Network Flows,” Addison-Wesley, Reeding, Mass., 1969. · Zbl 0197.45701
[5] ”Network Flow, Transportation and Scheduling: Theory and Algorithms,” Academic Press, New York, 1969. · Zbl 0281.90032
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.