Operations research: Literature

Operations Research (Literature)

Operations Research: Foundational Works

• Arrow K.J., Harris T., Marschak J. Optimal Inventory Policy // Econometrica. — 1951. — Vol. 19, No. 3. — P. 250–272. — DOI: 10.2307/1906813.
• Bellman R. Some Methods of Statistical Mechanics in Dynamic Programming // Proceedings of the National Academy of Sciences. — 1954. — Vol. 40, No. 10. — P. 965–969. — DOI: 10.1073/pnas.40.10.965.
• Bellman R. Dynamic Programming. — Princeton: Princeton University Press, 1957.
• Dantzig G.B. Maximization of a Linear Function of Variables Subject to Linear Inequalities // Koopmans T.C. (ed.). Activity Analysis of Production and Allocation. — New York: Wiley, 1951. — P. 339–347.
• Dantzig G.B., Fulkerson D.R., Johnson S.M. Solution of a Large-Scale Traveling-Salesman Problem // Journal of the Operations Research Society of America. — 1954. — Vol. 2, No. 4. — P. 393–410. — DOI: 10.1287/opre.2.4.393.
• Dantzig G.B., Wolfe P. Decomposition Principle for Linear Programs // Operations Research. — 1960. — Vol. 8, No. 1. — P. 101–111. — DOI: 10.1287/opre.8.1.101.
• Dijkstra E.W. A Note on Two Problems in Connexion with Graphs // Numerische Mathematik. — 1959. — Vol. 1. — P. 269–271. — DOI: 10.1007/BF01386390.
• Dinic E.A. Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation // Soviet Mathematics Doklady. — 1970. — Vol. 11. — P. 1277–1280.
• Edmonds J., Karp R.M. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems // Journal of the ACM. — 1972. — Vol. 19, No. 2. — P. 248–264. — DOI: 10.1145/321694.321699.
• Erlang A.K. The Theory of Probabilities and Telephone Conversations // Nyt Tidsskrift for Matematik B. — 1909. — Vol. 20. — P. 33–39.
• Ford L.R. Jr., Fulkerson D.R. Maximal Flow Through a Network // Canadian Journal of Mathematics. — 1956. — Vol. 8. — P. 399–404. — DOI: 10.4153/CJM-1956-045-5.
• Gale D., Shapley L.S. College Admissions and the Stability of Marriage // American Mathematical Monthly. — 1962. — Vol. 69, No. 1. — P. 9–15. — DOI: 10.2307/2312726.
• Gomory R.E. Outline of an Algorithm for Integer Solutions to Linear Programs // Bulletin of the American Mathematical Society. — 1958. — Vol. 64. — P. 275–278. — DOI: 10.1090/S0002-9904-1958-10287-5.
• Harris F.W. How Many Parts to Make at Once // Factory: The Magazine of Management. — 1913. — Vol. 10, No. 2. — P. 135–136.
• Held M., Karp R.M. A Dynamic Programming Approach to Sequencing Problems // Journal of the Society for Industrial and Applied Mathematics. — 1962. — Vol. 10, No. 1. — P. 196–210. — DOI: 10.1137/0110015.
• Howard R.A. Dynamic Programming and Markov Processes. — Cambridge, Mass.: M.I.T. Press, 1960.
• Jackson J.R. Networks of Waiting Lines // Operations Research. — 1957. — Vol. 5, No. 4. — P. 518–521. — DOI: 10.1287/opre.5.4.518.
• Johnson S.M. Optimal Two- and Three-Stage Production Schedules with Setup Times Included // Naval Research Logistics Quarterly. — 1954. — Vol. 1, No. 1. — P. 61–68. — DOI: 10.1002/nav.3800010110.
• Kantorovich L.V. Mathematical Methods of Organizing and Planning Production // Management Science. — 1960. — Vol. 6, No. 4. — P. 366–422. — DOI: 10.1287/mnsc.6.4.366. (English translation of the 1939 Russian original.)
• Karmarkar N. A New Polynomial-Time Algorithm for Linear Programming // Combinatorica. — 1984. — Vol. 4, No. 4. — P. 373–395. — DOI: 10.1007/BF02579150.
• Kendall D.G. Stochastic Processes Occurring in the Theory of Queues and Their Analysis by the Method of the Imbedded Markov Chain // Annals of Mathematical Statistics. — 1953. — Vol. 24, No. 3. — P. 338–354. — DOI: 10.1214/aoms/1177728975.
• Khachiyan L.G. A Polynomial Algorithm in Linear Programming // Doklady Akademii Nauk SSSR. — 1979. — Vol. 244, No. 5. — P. 1093–1096. (English translation: Soviet Mathematics Doklady. — 1979. — Vol. 20. — P. 191–194.)
• Kruskal J.B. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem // Proceedings of the American Mathematical Society. — 1956. — Vol. 7, No. 1. — P. 48–50. — DOI: 10.1090/S0002-9939-1956-0078686-7.
• Kuhn H.W., Tucker A.W. Nonlinear Programming // Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. — Berkeley: University of California Press, 1951. — P. 481–492.
• Kuhn H.W. The Hungarian Method for the Assignment Problem // Naval Research Logistics Quarterly. — 1955. — Vol. 2, No. 1–2. — P. 83–97. — DOI: 10.1002/nav.3800020109.
• Land A.H., Doig A.G. An Automatic Method of Solving Discrete Programming Problems // Econometrica. — 1960. — Vol. 28, No. 3. — P. 497–520. — DOI: 10.2307/1910129.
• Lindley D.V. The Theory of Queues with a Single Server // Mathematical Proceedings of the Cambridge Philosophical Society. — 1952. — Vol. 48, No. 2. — P. 277–289. — DOI: 10.1017/S0305004100027638.
• Little J.D.C. A Proof for the Queuing Formula: L = λW // Operations Research. — 1961. — Vol. 9, No. 3. — P. 383–387. — DOI: 10.1287/opre.9.3.383.
• Metropolis N., Ulam S. The Monte Carlo Method // Journal of the American Statistical Association. — 1949. — Vol. 44, No. 247. — P. 335–341. — DOI: 10.1080/01621459.1949.10483310.
• Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller A.H., Teller E. Equation of State Calculations by Fast Computing Machines // Journal of Chemical Physics. — 1953. — Vol. 21, No. 6. — P. 1087–1092. — DOI: 10.1063/1.1699114.
• Morse P.M., Kimball G.E. Methods of Operations Research. — New York: Wiley; Cambridge, Mass.: M.I.T. Press, 1951.
• Nash J.F. Equilibrium Points in n-Person Games // Proceedings of the National Academy of Sciences. — 1950. — Vol. 36, No. 1. — P. 48–49. — DOI: 10.1073/pnas.36.1.48.
• von Neumann J., Morgenstern O. Theory of Games and Economic Behavior. — Princeton: Princeton University Press, 1944.
• Prim R.C. Shortest Connection Networks and Some Generalizations // Bell System Technical Journal. — 1957. — Vol. 36, No. 6. — P. 1389–1401. — DOI: 10.1002/j.1538-7305.1957.tb01515.x.
• Scarf H. The Optimality of (S, s) Policies in the Dynamic Inventory Problem // Arrow K.J., Karlin S., Suppes P. (eds.). Mathematical Methods in the Social Sciences. — Stanford: Stanford University Press, 1960. — P. 196–202.
• Shapley L.S. A Value for n-Person Games // Kuhn H.W., Tucker A.W. (eds.). Contributions to the Theory of Games. Vol. II (Annals of Mathematics Studies, 28). — Princeton: Princeton University Press, 1953. — P. 307–317.
• Wagner H.M., Whitin T.M. Dynamic Version of the Economic Lot Size Model // Management Science. — 1958. — Vol. 5, No. 1. — P. 89–96. — DOI: 10.1287/mnsc.5.1.89.
• Wald A. Sequential Analysis. — New York: Wiley, 1947.
• Wilson R.H. A Scientific Routine for Stock Control // Harvard Business Review. — 1934. — Vol. 13, No. 1. — P. 116–128.