×

Cost operator algorithms for the transportation problem. (English) Zbl 0362.90058


MSC:

90C05 Linear programming
65K05 Numerical mathematical programming methods
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] M.L. Balinski and R.E. Gomory, ”A primal method for the assignment and transportation problems”,Management Science 10 (1964) 578–593. · doi:10.1287/mnsc.10.3.578
[2] A. Charnes and W.W. Cooper,Management models and industrial applications of linear programming, Vols. I and II (Wiley, New York, 1961). · Zbl 0107.37004
[3] G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).
[4] J. Edmonds and R.M. Karp, ”Theoretical improvements in algorithmic efficiency for network flow problems”,Journal of the Association for Computing Machinery 19 (1972) 248–264. · Zbl 0318.90024
[5] L.R. Ford and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, NJ, 1962). · Zbl 0106.34802
[6] A. Orden, ”The transshipment problem”,Management Science 2 (1956), 276–285. · Zbl 0995.90549 · doi:10.1287/mnsc.2.3.276
[7] M. Simmonard,Linear programming (Prentice-Hall, Englewood Cliffs, N.J., 1966).
[8] V. Srinivasan and G.L. Thompson, ”An operator theory of parametric programming for the transportation problem – I and II”,Naval Research Logistics Quarterly 19 (1972) 205–252. · Zbl 0269.90031 · doi:10.1002/nav.3800190202
[9] V. Srinivasan and G.L. Thompson, ”Accelerated algorithms for labelling and relabelling of trees, with applications to distribution problems”,Journal of the Association for Computing Machinery 19 (1972) 712–726. · Zbl 0255.90071
[10] V. Srinivasan and G.L. Thompson, ”Benefit-cost analysis of coding techniques for the primal transportation algorithm”,Journal of the Association for Computing Machinery 20 (1973) 194–213. · Zbl 0257.68034
[11] W. Szwarc, ”Some remarks on the time transportation problem”,Naval Research Logistics Quarterly 18 (1971) 473–485. · Zbl 0278.90046 · doi:10.1002/nav.3800180405
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.