1. Arrow, K.J. 1958. Chapter I: Historical background. In Studies in the mathematical theory of inventory and production, ed. K.J. Arrow, S. Karlin, and H. Scarf. Stanford: Stanford University Press.
2. Clark, A.J., and H. Scarf. 1960. Optimal policies for a multiechelon inventory problem. Management Science 6(4): 475–490.
3. Dantzig, G.B. 1955. Optimal solution of a dynamic Leontief model with substitution. Econometrica 23(3): 295–302.
4. Erickson, R.E., C.L. Monma, and A.F. Veinott Jr. 1981. Minimum-concave-cost network flows. Stanford: Department of Operations Research, Stanford University. Revised (1986) as Send-and-split method for minimum-concave-cost network flows. To appear in Mathematics of Operations Research.
5. Harris, F.W. 1915. Operation and costs (The Factory Management Series), 47–52. Chicago: A.W. Shaw Co.