References

1. Y. Adulyasak, J.‐F. Cordeau, and R. Jans. Formulations and branch‐and‐cut algorithms for multivehicle production and inventory routing problems. INFORMS Journal on Computing, 26(1):103–120, 2014.
2. Y. Agarwal, K. Mathur, and H. M. Salkin. A set‐partitioning‐based exact algorithm for the vehicle routing problem. Networks, 19(7):731–749, 1989.
3. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows. Prentice Hall, Upper Saddle River, NJ, 1993.
4. A. A. Akhil, G. Huff, A. B. Currier, B. C. Kaun, D. M. Rastler, S. B. Chen, A. L. Cotter, D. T. Bradshaw, and W. D. Gauntlett. DOE/EPRI 2013 electricity storage handbook in collaboration with NRECA. Report SAND2013‐5131, Sandia National Laboratories, July 2013.
5. U. Akinc and B. M. Khumawala. An efficient branch and bound algorithm for the capacitated warehouse location problem. Management Science, 23(6): 585–594, 1977.
6. E. Aktaş, O. Özaydın, B. Bozkaya, F. Ülengin, and Ş. Önsel. Optimizing fire station locations for the Istanbul Metropolitan Municipality. Interfaces, 43 (3):240–255, 2013.
7. K. Al‐Sultan and M. Al‐Fawzan. A tabu search approach to the uncapacitated facility location problem. Annals of Operations Research, 86:91–103, 1999.
8. N. Alguacil, A. L. Motto, and A. J. Conejo. Transmission expansion planning: A mixed‐integer LP approach. IEEE Transactions on Power Systems, 18(3): 1070–1077, 2003.
9. Ö. G. Ali, S. Sayın, T. Van Woensel, and J. Fransoo. SKU demand forecasting in the presence of promotions. Expert Systems with Applications, 36(10): 12340–12348, 2009.
10. N. Altay and W. G. Green. OR/MS research in disaster operations management. European Journal of Operational Research, 175(1):475–493, 2006.
11. S. Alumur and B. Y. Kara. Network hub location problems: The state of the art. European Journal of Operational Research, 190(1):1–21, 2008.
12. R. M. Anderson and R. M. May. Infectious Diseases of Humans: Dynamics and Control. Oxford University Press, New York, 1992.
13. D. Applegate, R. Bixby, V. Chvátal, and B. Cook. Finding cuts in the TSP (a preliminary report). Technical report, DIMACS, Rutgers University, New Brunswick, NJ, 1995.
14. D. Applegate, R. Bixby, V. Chvátal, and W. J. Cook. Concorde (software), 2006. URL http://www.math.uwaterloo.ca/tsp/concorde.
15. D. L. Applegate, V. Chvátal, W. J. Cook, and R. E. Bixby. The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton, NJ, 2007.
16. C. Archetti, L. Bertazzi, G. Laporte, and M. G. Speranza. A branch‐and‐cut algorithm for a vendor‐managed inventory–routing problem. Transportation Science, 41(3):382–391, 2007.
17. B. C. Archibald and E. A. Silver. policies under continuous review and discrete compound poisson demand. Management Science, 24(9):899–909, 1978.
18. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5):753–782, 1998.
19. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501–555, 1998.
20. M. A. Arostegui, Jr., S. N. Kadipasaoglu, and B. M. Khumawala. An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems. International Journal of Production Economics, 103(2):742–754, 2006.
21. K. J. Arrow, T. Harris, and J. Marschak. Optimal inventory policy. Econometrica, 19(3):250–272, 1951.
22. A. Atamtürk. On capacitated network design cut–set polyhedra. Mathematical Programming, 92(3):425–437, 2002.
23. A. Atamturk, G. Berenguer, and Z.‐J. M. Shen. A conic integer programming approach to stochastic joint location‐inventory problems. Operations Research, 60(2):366–381, 2012.
24. L. M. Ausubel and P. Milgrom. The lovely but lonely Vickrey auction. In P. Cramton, Y. Shoham, and R. Steinberg, editors, Combinatorial Auctions, chapter 1, pages 17–40. MIT Press, 2006.
25. I. Averbakh and O. Berman. Algorithms for the robust 1‐center problem on a tree. European Journal of Operational Research, 123(2):292–302, 2000a.
26. I. Averbakh and O. Berman. Minmax regret median location on a network under uncertainty. INFORMS Journal on Computing, 12(2):104–110, 2000b.
27. A. Avrahami, Y. T. Herer, and R. Levi. Matching supply and demand: Delayed two‐phase distribution at Yedioth Group—models, algorithms, and information technology. Interfaces, 44(5):445–460, 2014.
28. S. Axsäter. Simple solution procedures for a class of two‐echelon inventory problems. Operations Research, 38(1):64–69, 1990.
29. S. Axsäter. Using the deterministic EOQ formula in stochastic inventory control. Management Science, 42(6):830–834, 1996.
30. B. Aytac and S. D. Wu. Characterization of demand for short life‐cycle technology products. Annals of Operations Research, 203(1):255–277, 2013.
31. E. Babiloni, E. Guijarro, M. Cardós, and S. Estellés. Exact fill rates for the (R, S) inventory control with discrete distributed demands for the backordering case. Informatica Economica&c.caron;, 16(3):19–26, 2012.
32. G. Babin, S. Deneault, and G. Laporte. Improvements to the Or‐opt heuristic for the symmetric travelling salesman problem. Journal of the Operational Research Society, 58:402–407, 2007.
33. F. Babonneau, Y. Nesterov, and J.‐P. Vial. Design and operations of gas transmission networks. Operations Research, 60(1):34–47, 2012.
34. A. Balakrishnan, T. L. Magnanti, and R. T. Wong. A dual‐ascent procedure for large‐scale uncapacitated network design. Operations Research, 37(5): 716–740, 1989.
35. E. Balas and P. Toth. Branch and bound methods. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, chapter 10, pages 361–401. John Wiley & Sons, Hoboken, NJ, 1985.
36. B. Balcik, B. M. Beamon, and K. Smilowitz. Last mile distribution in humanitarian relief. Journal of Intelligent Transportation Systems, 12(2): 51–63, 2008.
37. M. L. Balinski. Integer programming: Methods, uses, computation. Management Science, 12(3):253–313, 1965.
38. M. L. Balinski and R. E. Quandt. On an integer program for a delivery problem. Operations Research, 12(2):300–304, 1964.
39. R. H. Ballou. Dynamic warehouse location analysis. Journal of Marketing Research, 5:271–276, 1968.
40. M. Banciu and P. Mirchandani. Technical note—new results concerning probability distributions with increasing generalized failure rates. Operations Research, 61(4):925–931, 2013.
41. F. Barahona and D. Jensen. Plant location with minimum inventory. Mathematical Programming, 83:101–111, 1998.
42. J. Barcelo, E. Fernandez, and K. O. Jörnsten. Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem. European Journal of Operational Research, 53(1):38–45, 1991.
43. C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance. Branch‐and‐price: Column generation for solving huge integer programs. Operations Research, 46(3):316–329, 1998.
44. J. J. Bartholdi and L. K. Platzman. An planar travelling salesman heuristic based on spacefilling curves. Operations Research Letters, 1(4):121–125, 1982.
45. J. J. Bartholdi, L. K. Platzman, R. L. Collins, and W. H. Warden. A minimal technology routing system for Meals on Wheels. Interfaces, 13(3):1–8, 1983.
46. F. Bass. A new product growth model for consumer durables. Management Science, 15(5):215–227, 1969.
47. F. Bass. Comments on “A new product growth for model consumer durables”: The Bass model. Management Science, 50(12S):1833–1840, 2004.
48. J. Beardwood, J. H. Halton, and J. M. Hammersley. The shortest path through many points. Mathematical Proceedings of the Cambridge Philosophical Society, 55(4):299–327, 1959.
49. J. E. Beasley. Route first–cluster second methods for vehicle routing. OMEGA, 11(4):403–408, 1983.
50. S. Beggs, S. Cardell, and J. Hausman. Assessing the potential demand for electric cars. Journal of Econometrics, 16:1–19, 1981.
51. C. E. Bell. Improved algorithms for inventory and replacement‐stocking problems. SIAM Journal on Applied Mathematics, 18(3):558–566, 1970.
52. R. Bellman. Dynamic programming treatment of the travelling salesman problem. Journal of the ACM, 9(1):61–63, 1962.
53. E. J. Beltrami and L. D. Bodin. Networks and vehicle routing for municipal waste collection. Networks, 4(1):65–94, 1974.
54. M. Ben‐Akiva and S. Lerman. Discrete Choice Analysis: Theory and Application to Travel Demand. MIT Press, Cambridge, MA, 1985.
55. G. Benoit and S. Boyd. Finding the exact integrality gap for small traveling salesman problems. Mathematics of Operations Research, 33(4):921–931, 2008.
56. J. J. Bentley. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing, 4(4):387–411, 1992.
57. R. T. Berger, C. R. Coullard, and M. S. Daskin. Location‐routing problems with distance constraints. Transportation Science, 41(1):29–43, 2007.
58. E. Berk and A. Arreola‐Risa. Note on “Future supply uncertainty in EOQ models”. Naval Research Logistics, 41(1):129–132, 1994.
59. O. Berman, D. Krass, and M. B. C. Menezes. Facility reliability issues in network p‐median problems: Strategic centralization and co‐location effects. Operations Research, 55(2):332–350, 2007.
60. D. Bienstock and O. Günlük. Capacitated network design—Polyhedral structure and computation. INFORMS Journal on Computing, 8(3):243–259, 1996.
61. M. Bijvank and I. F. Vis. Lost‐sales inventory theory: A review. European Journal of Operational Research, 215(1):1–13, 2011.
62. S. Biller, A. Muriel, and Y. Zhang. Impact of price postponement on capacity and flexibility investment decisions. Production and Operations Management, 15 (2):198–214, 2006.
63. S. Binato, M. V. F. Pereira, and S. Granville. A new Benders decomposition approach to solve power transmission network design problems. IEEE Transactions on Power Systems, 16(2):235–240, 2001.
64. A. Bixby. Polyhedral Analysis and Effective Algorithms for the Capacitated Vehicle Routing Problem. Ph.D. dissertation, Northwestern University, Evanston, IL, 1998.
65. C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3):268–308, 2003.
66. N. Boudette. Chrysler gains edge by giving new flexibility to its factories. Wall Street Journal, April 11, 2006.
67. S. Boyd and R. Carr. A new bound for the ratio between the 2‐matching problem and its linear programming relaxation. Mathematical Programming Series A, 86:499–514, 1999.
68. S. Boyd and R. Carr. Finding low cost TSP and 2‐matching solutions using certain half‐integer subtour vertices. Discrete Optimization, 8(4):525–539, 2011.
69. S. Boyd and P. Elliott‐Magwood. The structure of the extreme points of the subtour elimination polytope of the STSP. In S. Iwata, editor, Combinatorial Optimization and Discrete Algorithms, volume B23 of RIMS Kôkyûroku Bessatsu. Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, 2010.
70. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, New York, 7th edition, 2009.
71. S. C. Boyd, W. H. Cunningham, M. Queyranne, and Y. Wang. Ladders for travelling salesmen. SIAM Journal on Optimization, 5:408–420, 1995.
72. J. Bramel and D. Simchi‐Levi. A location based heuristic for general routing problems. Operations Research, 43(4):649–660, 1995.
73. J. Bramel and D. Simchi‐Levi. Probabilistic analysis and practical algorithms for the vehicle routing problem with time windows. Operations Research, 44: 501–509, 1996.
74. J. Bramel and D. Simchi‐Levi. On the effectiveness of set covering formulations for the vehicle routing problem with time windows. Operations Research, 45 (2):295–301, 1997.
75. J. Bramel and D. Simchi‐Levi. Set‐covering‐based algorithms for the capacitated VRP. In P. Toth and D. Vigo, editors, The Vehicle Routing Problem, chapter 4, pages 85–108. Society for Industrial and Applied Mathematics, Philadelphia, 2001.
76. J. Bramel, E. G. Coffman, P. W. Shor, and D. Simchi‐Levi. Probabilistic analysis of the capacitated vehicle routing problem with unsplit demands. Operations Research, 40(6):1095–1106, 1992.
77. P. D. Brown, J. A. P. Lopes, and M. A. Matos. Optimization of pumped storage capacity in an isolated power system with large renewable penetration. IEEE Transactions on Power Systems, 23(2):523–531, 2008.
78. S. Browne and P. Zipkin. Inventory models with continuous, stochastic demands. Annals of Applied Probability, 1(3):419–435, 1991.
79. C. A. Butler and J. D. Camm. Introduction: The 2009 Daniel H. Wagner Prize for excellence in operations research practice. Interfaces, 40(5):339–341, 2010.
80. G. P. Cachon. Supply chain coordination with contracts. In A. G. de Kok and S. C. Graves, editors, Supply Chain Management: Design, Coordination and Operation, volume 11 of Handbooks in Operations Research and Management Science, chapter 6. Elsevier, New York, 2003.
81. G. P. Cachon and M. A. Lariviere. Supply chain coordination with revenue‐sharing contracts: Strengths and limitations. Management Science, 51(1):30–44, 2005.
82. G. P. Cachon and S. Netessine. Game theory in supply chain analysis. In D. Simchi‐Levi, S. D. Wu, and Z.‐J. M. Shen, editors, Handbook of Quantitative Supply Chain Analysis: Modeling in the E‐Business Era, chapter 2. Springer, New York, 2004.
83. P. Camerini, L. Fratta, and F. Maffioli. On improving relaxation methods by modified gradient techniques. In M. L. Balinski and P. Wolfe, editors, Nondifferentiable Optimization, volume 3 of Mathematical Programming Studies, pages 26–34. Springer, Berlin, 1975.
84. J. F. Campbell. Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72(2):387–405, 1994a.
85. J. F. Campbell. A survey of network hub location. Studies in Locational Analysis, 6(6):31–49, 1994b.
86. J. F. Campbell. Hub location and the p‐hub median problem. Operations Research, 44(6):923–935, 1996.
87. R. Carbonneau, K. Laframboise, and R. Vahidov. Application of machine learning techniques for supply chain demand forecasting. European Journal of Operational Research, 184(3):1140–1154, 2008.
88. B. Carlson, Y. Chen, M. Hong, R. Jones, K. Larson, X. Ma, P. Nieuwesteeg, H. Song, K. Sperry, M. Tackett, D. Taylor, J. Wan, and E. Zak. MISO unlocks billions in savings through the application of operations research for energy and ancillary services markets. Interfaces, 42(1):58–73, 2012.
89. E. D. Castronuovo and J. A. P. Lopes. On the optimization of the daily operation of a wind‐hydro power plant. IEEE Transactions on Power Systems, 19(3): 1599–1606, 2004.
90. A. M. Caunhye, X. Nie, and S. Pokharel. Optimization models in emergency logistics: A literature review. Socio‐Economic Planning Sciences, 46(1):4–13, 2012.
91. M. Çelik, Ö. Ergun, B. Johnson, P. Keskinocak, Á. Lorca, P. Pekgün, and J. Swann. Humanitarian logistics. In P. B. Mirchandani, editor, INFORMS Tutorials in Operations Research, chapter 2, pages 18–49. INFORMS, Hanover, MD, 2012.
92. M. Çelik, Ö. Ergun, P. Keskinocak, M. Soldner, and J. Swann. Humanitarian applications of supply chain optimization. In T. Terlaky, M. Anjos, and S. Ahmed, editors, Advances and Trends in Optimization with Engineering Applications, chapter 36, pages 479–492. SIAM, Philadelphia, 2017.
93. S. Çetinkaya, H. Üster, G. Easwaran, and B. B. Keskin. An integrated outbound logistics model for Frito‐Lay: Coordinating aggregate‐level production and distribution decisions. Interfaces, 39(5):460–475, 2009.
94. L. M. A. Chan, A. Muriel, Z.‐J. M. Shen, and D. Simchi‐Levi. On the effectiveness of zero‐inventory‐ordering policies for the economic lot‐sizing model with a class of piecewise linear cost structures. Operations Research, 50(6): 1058–1067, 2002.
95. R. Chandrasekaran and A. Daughety. Location on tree networks: p‐centre and n‐dispersion problems. Mathematics of Operations Research, 6(1):50–57, 1981.
96. B. Chen and C.‐S. Lin. Minmax‐regret robust 1‐median location on a tree. Networks, 31(2):93–103, 1998.
97. F. Chen and R. Samroengraja. The stationary beer game. Production and Operations Management, 9(1):19–30, 2000.
98. F. Chen and Y.‐S. Zheng. Lower bounds for multi‐echelon stochastic inventory systems. Management Science, 40(11):1426–1443, 1994.
99. F. Chen, Z. Drezner, J. K. Ryan, and D. Simchi‐Levi. Quantifying the bullwhip effect in a simple supply chain: The impact of forecasting, lead times, and information. Management Science, 46(3):436–443, 2000.
100. R. R. Chen, R. O.Roundy, R. Q. Zhang, and G. Janakiraman. Efficient auction mechanisms for supply chain procurement. Management Science, 51(3): 467–482, 2005.
101. W. Chen, M. Dawande, and G. Janakiraman. Fixed‐dimensional stochastic dynamic programs: An approximation scheme and an inventory application. Operations Research, 62(1):81–103, 2014.
102. R. Cheung and W. B. Powell. Models and algorithms for distribution problems with uncertain demands. Transportation Science, 30(1):43–59, 1996.
103. Chicago Data Portal. Libraries—locations, hours and contact information [data set], June 2, 2017a. URL https://data.cityofchicago.org/Education/Libraries‐Locations‐Hours‐and‐Contact‐Information/x8fc‐8rcq.
104. Chicago Data Portal. Chicago public schools—school locations SY1718 [data set], September 5, 2017b. URL https://data.cityofchicago.org/Education/Chicago‐Public‐Schools‐School‐Locations‐SY1718/4g38‐vs8v.
105. S. E. Chick, H. Mamani, and D. Simchi‐Levi. Supply chain coordination and influenza vaccination. Operations Research, 56(6):1493–1506, 2008.
106. F. Chiyoshi and R. D. Galvão. A statistical analysis of simulated annealing applied to the p‐median problem. Annals of Operations Research, 96(1): 61–74, 2000.
107. S. Chopra and P. Meindl. Supply Chain Management: Strategy, Planning and Operation. Prentice‐Hall, Upper Saddle River, NJ, 2001.
108. M. C. Chou, C.‐P. Teo, and H. Zheng. Process flexibility: Design, evaluation and applications. Flexible Services and Manufacturing Journal, 20:59–94, 2008.
109. M. C. Chou, G. A. Chua, and C.‐P. Teo. On range and response: Dimensions of process flexibility. European Journal of Operational Research, 207(2): 711–724, 2010a.
110. M. C. Chou, G. A. Chua, C.‐P. Teo, and H. Zheng. Design for process flexibility: Efficiency of the long chain and sparse structure. Operations Research, 58(1): 43–58, 2010b.
111. M. C. Chou, G. A. Chua, C.‐P. Teo, and H. Zheng. Process flexibility revisited: The graph expander and its applications. Operations Research, 59(5): 1090–1105, 2011.
112. N. Christofides. Worst‐case analysis of a new heuristic for the travelling salesman problem. Management Sciences Research Report 388, Carnegie‐Mellon University, 1976.
113. N. Christofides and J. E. Beasley. Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem. European Journal of Operational Research, 12(1):19–28, 1983.
114. N. Christofides and J. E. Beasley. The period routing problem. Networks, 14(2): 237–256, 1984.
115. N. Christofides and S. Eilon. An algorithm for the vehicle‐dispatching problem. Operational Research Quarterly, 20(3):309–318, 1969.
116. N. Christofides, A. Mingozzi, and P. Toth. The vehicle routing problem. In N. Christofides, A. Mingozzi, and P. Toth, editors, Combinatorial Optimization, pages 315–338. Wiley, Chichester, 1979.
117. N. Christofides, A. Mingozzi, and P. Toth. State‐space relaxation procedures for the computation of bounds to routing problems. Networks, 11(2):145–164, 1981.
118. L. Chu and Z.‐J. M. Shen. Note on the complexity of the safety stock placement problem. Technical note, University of Florida, 2003.
119. L. Y. Chu and Z.‐J. M. Shen. Agent competition double auction mechanism. Management Science, 52:1215–1222, 2006.
120. L. Y. Chu and Z.‐J. M. Shen. Truthful double auction mechanisms. Operations Research, 56:102–120, 2008.
121. R. Church and C. ReVelle. The maximal covering location problem. Papers of the Regional Science Association, 32:101–118, 1974.
122. R. L. Church and R. S. Garfinkel. Locating an obnoxious facility on a network. Transportation Science, 12(2):107–118, 1978.
123. F. W. Ciarallo, R. Akella, and T. E. Morton. A periodic review, production planning model with uncertain capacity and uncertain demand—optimality of extended myopic policies. Management Science, 40(3):320–332, 1994.
124. A. J. Clark and H. Scarf. Optimal policies for a multi‐echelon inventory problem. Management Science, 6(4):475–490, 1960.
125. G. Clarke and J. W. Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4):568–581, 1964.
126. L. C. Coelho and G. Laporte. The exact solution of several classes of inventory–routing problems. Computers & Operations Research, 40(2): 558–565, 2013.
127. L. C. Coelho, J.‐F. Cordeau, and G. Laporte. Thirty years of inventory routing. Transportation Science, 48(1):1–19, 2013.
128. J. L. Cohon. Multiobjective Programming and Planning. Academic Press, New York, 1978.
129. B. Colson, P. Marcotte, and G. Savard. An overview of bilevel optimization. Annals of Operations Research, 153(1):235–256, 2007.
130. W. J. Cook. In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton, NJ, 2012.
131. W. J. Cook. The traveling salesman problem. Website, 2018a. URL http://www.math.uwaterloo.ca/tsp/index.html.
132. W. J. Cook. Concorde TSP app. Software, 2018b.
133. W. J. Cook and V. Chvátal. The birth of the cutting‐plane method. In M. Jünger, T. M. Liebling, D. Naddef, G. L. Nemhauser, W. R. Pulleyblank, G. Reinelt, G. Rinaldi, and L. A. Wolsey, editors, 50 Years of Integer Programming 1958–2008: From the Early Years to the State‐of‐the‐Art, pages 7–9. Springer, Berlin, 2010.
134. C. J. Corbett and K. Rajaram. A generalization of the inventory pooling effect to nonnormal dependent demand. Manufacturing & Service Operations Management, 8(4):351–358, 2006.
135. J.‐F. Cordeau and G. Laporte. Tabu search heuristics for the vehicle routing problem. In R. Sharda, S. Voss, C. Rego, and B. Alidaee, editors, Metaheuristic Optimization via Memory and Evolution, volume 30 of Operations Research/Computer Science Interfaces Series, pages 145–163. Springer US, New York, 2005.
136. J.‐F. Cordeau, M. Gendreau, and G. Laporte. A tabu search heuristic for periodic and multi‐depot vehicle routing problems. Networks, 30(2):105–119, 1997.
137. J.‐F. Cordeau, G. Desaulniers, J. Desrosiers, M. M. Solomon, and F. Soumis. VRP with time windows. In P. Toth and D. Vigo, editors, The Vehicle Routing Problem, chapter 7, pages 157–193. Society for Industrial and Applied Mathematics, Philadelphia, 2001.
138. J.‐F. Cordeau, M. Gendreau, G. Laporte, J.‐Y. Potvin, and F. Semet. A guide to vehicle routing heuristics. Journal of the Operational Research Society, 53 (5):512–522, 2002.
139. G. Cornuejols and F. Harche. Polyhedral study of the capacitated vehicle routing problem. Mathematical Programming, 60(1–3):21–52, 1993.
140. G. Cornuejols, M. L. Fisher, and G. L. Nemhauser. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science, 23(8):789–810, 1977.
141. G. Cornuéjols, J. Fonlupt, and D. Naddef. The traveling salesman problem on a graph and some related integer polyhedra. Mathematical Programming Series B, 33(1):1–27, 1985.
142. G. Cornuejols, R. Sridharan, and J. Thizy. A comparison of heuristics and relaxations for the capacitated plant location problem. European Journal of Operational Research, 50:280–297, 1991.
143. A. M. Costa. A survey on Benders decomposition applied to fixed‐charge network design problems. Computers & Operations Research, 32(6): 1429–1450, 2005.
144. Council of Supply Chain Management Professionals. Annual state of logistics report: Steep grade ahead, 2018a.
145. Council of Supply Chain Management Professionals. CSCMP supply chain management definitions and glossary, 2018b. URL https://cscmp.org/CSCMP/Educate/SCM_Definitions_and_Glossary_of_Terms/CSCMP/Educate/SCM_Definitions_and_Glossary_of_Terms.aspx.
146. T. G. Crainic, M. Gendreau, and J. M. Farvolden. A simplex‐based tabu search method for capacitated network design. INFORMS Journal on Computing, 12(3):223–236, 2000.
147. T. G. Crainic, A. Frangioni, and B. Gendron. Bundle‐based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Applied Mathematics, 112(1):73–99, 2001.
148. G. A. Croes. A method for solving traveling‐salesman problems. Operations Research, 6(6):791–812, 1958.
149. H. Crowder and M. W. Padberg. Solving large‐scale symmetric travelling salesman problems to optimality. Management Science, 26(5):495–509, 1980.
150. T. Cui, Y. Ouyang, and Z.‐J. M. Shen. Reliable facility location design under the risk of disruptions. Operations Research, 58(4):998–1011, 2010.
151. M. Dada, N. C. Petruzzi, and L. B. Schwarz. A newsvendor's procurement problem when suppliers are unreliable. Manufacturing & Service Operations Management, 9(1):9–32, 2007.
152. G. B. Dantzig and J. H. Ramser. The truck dispatching problem. Management Science, 6(1):80–91, 1959.
153. G. B. Dantzig and P. Wolfe. Decomposition principle for linear programs. Operations Research, 8(1):101–111, 1960.
154. G. B. Dantzig, D. R. Fulkerson, and S. Johnson. Solution of a large‐scale traveling‐salesman problem. Journal of the Operations Research Society of America, 2(4):393–410, 1954.
155. G. B. Dantzig, D. R. Fulkerson, and S. M. Johnson. On a linear‐programming, combinatorial approach to the traveling‐salesman problem. Operations Research, 7(1):58–66, 1959.
156. A. Dasci. Conditional location problems on networks and in the plane. In H. A. Eiselt and V. Marianov, editors, Foundations of Location Analysis, chapter 9, pages 179–206. Springer‐Verlag, Berlin, 2011.
157. M. S. Daskin. Network and Discrete Location: Models, Algorithms, and Applications. Wiley, New York, 1995.
158. M. S. Daskin. A new approach to solving the vertex p‐center problem to optimality: Algorithm and computational results. Communications of the Operations Research Society of Japan, 45(9):428–436, 2000.
159. M. S. Daskin. Service Science. Wiley, Hoboken, NJ, 2010.
160. M. S. Daskin. Network and Discrete Location: Models, Algorithms, and Applications. Wiley, New York, 2nd edition, 2013.
161. M. S. Daskin, C. R. Coullard, and Z.‐J. M. Shen. An inventory‐location model: Formulation, solution algorithm and computational results. Annals of Operations Research, 110(1–4):83–106, 2002.
162. C. d'Aspremont, J. J. Gabszewicz, and J.‐F. Thisse. On Hotelling's “stability in competition”. Econometrica, 47(5):1145–1150, 1979.
163. T. Davenport. Analytics 3.0. Harvard Business Review, December 2013.
164. P. Davis and T. L. Ray. A branch‐bound algorithm for the capacitated facilities location problem. Naval Research Logistics Quarterly, 16:331–344, 1969.
165. T. de Kok, F. Janssen, J. van Doremalen, E. van Wachem, M. Clerkx, and W. Peeters. Philips Electronics synchronizes its supply chain to end the bullwhip effect. Interfaces, 35(1):37–48, 2005.
166. T. G. de Kok and J. C. Fransoo. Planning supply chain operations: Definition and comparison of planning concepts. In Supply Chain Management: Design, Coordination and Operation, volume 11 of Handbooks in Operations Research and Management Science, pages 597–675. Elsevier, New York, 2003.
167. T. G. de Kok and J. W. Visschers. Analysis of assembly systems with service level constraints. International Journal of Production Economics, 59(1):313–326, 1999.
168. S. de Vries and R. V. Vohra. Combinatorial auctions: A survey. INFORMS Journal on Computing, 15(3):284–309, 2003.
169. D. De Wolf and Y. Smeers. The gas transmission problem solved by an extension of the simplex algorithm. Management Science, 46(11):1454–1465, 2000.
170. I. Deif and L. D. Bodin. Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling. In A. Kidder, editor, Proceedings of the Babson College Conference on Software Uses in Transportation and Logistic Management, pages 75–96, Babson Park, MA, 1984.
171. S. DeNegre and T. K. Ralphs. A branch‐and‐cut algorithm for integer bilevel linear programs. In Operations Research and Cyber‐Infrastructure, pages 65–78. Springer, New York, 2009.
172. G. Desaulniers, J. Desrosiers, A. Erdmann, M. M. Solomon, and F. Soumis. VRP with pickup and delivery. In P. Toth and D. Vigo, editors, The Vehicle Routing Problem, chapter 9, pages 225–242. Society for Industrial and Applied Mathematics, Philadelphia, 2001.
173. K. DesMarteau. Leading the way in changing times. Bobbin, 41(2):48–54, 1999.
174. M. Desrochers and T. W. Verhoog. A matching based savings algorithm for the vehicle routing problem. Les Cahiers du GERAD G‐89‐04, École des Hautes Études Commerciales de Montréal, 1989.
175. M. Desrochers, J. Desrosiers, and M. Solomon. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2): 342–354, 1992.
176. M. Drexl and M. Schneider. A survey of variants and extensions of the location‐routing problem. European Journal of Operational Research, 241(2): 283–308, 2015.
177. Z. Drezner. Competitive location strategies for two facilities. Regional Science and Urban Economics, 12(4):485–493, 1982.
178. Z. Drezner, editor. Facility Location: A Survey of Applications and Methods. Springer‐Verlag, New York, 1995a.
179. Z. Drezner. Dynamic facility location: The progressive p‐median problem. Location Science, 3(1):1–7, 1995b.
180. Z. Drezner and H. W. Hamacher, editors. Facility Location: Applications and Theory. Springer‐Verlag, New York, 2002.
181. Z. Drezner and S. Salhi. Using hybrid metaheuristics for the one‐way and two‐way network design problem. Naval Research Logistics, 49(5):449–463, 2002.
182. Z. Drezner and G. O. Wesolowsky. Facility location when demand is time dependent. Naval Research Logistics, 38(5):763–777, 1991.
183. L. M. Drummond, L. S. Ochi, and D. S. Vianna. An asynchronous parallel metaheuristic for the period vehicle routing problem. Future Generation Computer Systems, 17(4):379–386, 2001.
184. Y. P. Dusonchet and A. El‐Abiad. Transmission planning using discrete dynamic optimizing. IEEE Transactions on Power Apparatus and Systems, PAS‐92(4): 1358–1371, 1973.
185. F. Edgeworth. The mathematical theory of banking. Journal of the Royal Statistical Society, 51:113–127, 1888.
186. J. Edmonds. Maximum matching and a polyhedron with 0,1‐vertices. Journal of Research of the National Bureau of Standards–B, 69B(1 and 2):125–130, 1965.
187. M. A. Efroymson and T. L. Ray. A branch‐bound algorithm for plant location. Operations Research, 14(3):361–368, 1966.
188. R. Ehrhardt. The power approximation for computing inventory policies. Management Science, 25(8):777–786, 1979.
189. R. Ehrhardt and C. Mosier. A revision of the power approximation for computing policies. Management Science, 30(5):618–622, 1984.
190. S. Eilon, C. D. T. Watson‐Gandy, and N. Christofides. Distribution Management: Mathematical Modelling and Practical Analysis. Griffin, London, 1971.
191. H. A. Eiselt. Equilibria in competitive location models. In H. A. Eiselt and V. Marianov, editors, Foundations of Location Analysis, chapter 7, pages 139–162. Springer‐Verlag, Berlin, 2011.
192. H. A. Eiselt and V. Marianov, editors. Foundations of Location Analysis. Springer‐Verlag, New York, 2011.
193. H. A. Eiselt and C.‐L. Sandblom. Decision Analysis, Location Models, and Scheduling Problems. Springer, New York, 2004.
194. H. A. Eiselt, G. Laporte, and J.‐F. Thisse. Competitive location models: A framework and bibliography. Transportation Science, 27(1):44–54, 1993.
195. S. Elloumi, M. Labbé, and Y. Pochet. A new formulation and resolution method for the p‐center problem. INFORMS Journal on Computing, 16(1):84–94, 2004.
196. G. D. Eppen. Effects of centralization on expected costs in a multi‐location newsboy problem. Management Science, 25(5):498–501, 1979.
197. R. Epstein, L. Henríquez, J. Catalán, G. Y. Weintraub, C. Martínez, and F. Espejo. A combinatorial auction improves school meals in Chile: A case of OR in developing countries. International Transactions in Operational Research, 11:593–612, 2004.
198. S. J. Erlebacher and R. D. Meller. The interaction of location and inventory in designing distribution systems. IIE Transactions, 32:155–166, 2000.
199. D. Erlenkotter. A dual‐based procedure for uncapacitated facility location. Operations Research, 26(6):992–1009, 1978.
200. D. Erlenkotter. Ford Whitman Harris and the economic order quantity model. Operations Research, 38(6):937–946, 1990.
201. I. Farasyn, K. Perkoz, and W. Van de Velde. Spreadsheet models for inventory target setting at Procter & Gamble. Interfaces, 38(4):241–250, 2008.
202. I. Farasyn, S. Humair, J. I. Kahn, J. J. Neale, O. Rosen, J. Ruark, W. Tarlton, W. Van de Velde, G. Wegryn, and S. P. Willems. Inventory optimization at Procter & Gamble: Achieving real benefits through user adoption of inventory tools. Interfaces, 41(1):66–78, 2011.
203. M. Farvid and K. Rosling. The square root algorithm for single item lot sizing. Working paper, Linnæus University, Växjö, Sweden, 2014.
204. M. H. Fazel Zarandi, S. Davari, and S. A. Haddad Sisakht. The large scale maximal covering location problem. Scientia Iranica, 18(6):1564–1570, 2011.
205. A. Federgruen and M. Tzur. A simple forward algorithm to solve general dynamic lot sizing models with n periods in or time. Management Science, 37(8):909–925, 1991.
206. A. Federgruen and Y.‐S. Zheng. An efficient algorithm for computing an optimal policy in continuous review stochastic inventory systems. Operations Research, 40(4):808–813, 1992.
207. A. Federgruen and P. Zipkin. Computational issues in an infinite‐horizon, multiechelon inventory model. Operations Research, 32(2):818–836, 1984.
208. E. Feitzinger and H. L. Lee. Mass customization at Hewlett‐Packard: The power of postponement. Harvard Business Review, 75:116–123, 1997.
209. K. J. Ferreira, B. H. A. Lee, and D. Simchi‐Levi. Analytics for an online retailer: Demand forecasting and price optimization. Manufacturing & Service Operations Management, 18(1):69–88, 2015.
210. S. R. Finch. Mathematical Constants. Cambridge University Press, New York, 2003.
211. M. L. Fisher. The Lagrangian relaxation method for solving integer programming problems. Management Science, 27(1):1–18, 1981.
212. M. L. Fisher. An applications oriented guide to Lagrangian relaxation. Interfaces, 15(2):10–21, 1985.
213. M. L. Fisher. Optimal solution of vehicle routing problems using minimum k‐trees. Operations Research, 42(4):626–642, 1994a.
214. M. L. Fisher. A polynomial algorithm for the degree‐constrained minimum K‐tree problem. Operations Research, 42(4):775–779, 1994b.
215. M. L. Fisher and R. Jaikumar. A generalized assignment heuristic for vehicle routing. Networks, 11(2):109–124, 1981.
216. B. Fleischmann. A new class of cutting planes for the symmetric travelling salesman problem. Mathematical Programming Series B, 40(1–3):225–246, 1988.
217. M. M. Flood. The traveling‐salesman problem. Operations Research, 4(1):61–75, 1956.
218. M. Florian, J. K. Lenstra, and A. H. G. Rinnooy Kan. Deterministic production planning: Algorithms and complexity. Management Science, 26(7):669–679, 1980.
219. L. R. Ford and D. R. Fulkerson. A suggested computation for maximal multi‐commodity network flows. Management Science, 5(1):97–101, 1958.
220. J. W. Forrester. Industrial dynamics: A major breakthrough for decision makers. Harvard Business Review, 36(4):37–66, 1958.
221. B. A. Foster and D. M. Ryan. An integer programming approach to the vehicle scheduling problem. Operational Research Quarterly, 27(2, part 1):367–384, 1976.
222. P. Francis and K. Smilowitz. Modeling techniques for periodic vehicle routing problems. Transportation Research Part B: Methodological, 40(10):872–884, 2006.
223. P. Francis, K. Smilowitz, and M. Tzur. The period vehicle routing problem with service choice. Transportation Science, 40(4):439–454, 2006.
224. P. M. Francis, K. R. Smilowitz, and M. Tzur. The period vehicle routing problem and its extensions. In B. Golden, S. Raghavan, and E. Wasil, editors, The Vehicle Routing Problem: Latest Advances and New Challenges, volume 43 of Operations Research/Computer Science Interfaces, pages 73–102. Springer US, New York, 2008.
225. S. Frank, I. Steponavice, and S. Rebennack. Optimal power flow: A bibliographic survey I: Formulations and deterministic methods. Energy Systems, 3(3): 221–258, 2012a.
226. S. Frank, I. Steponavice, and S. Rebennack. Optimal power flow: A bibliographic survey II: Non‐deterministic and hybrid methods. Energy Systems, 3(3): 259–289, 2012b.
227. J. Friedman, T. Hastie, and R. Tibshirani. The Elements of Statistical Learning. Springer, Berlin, 2001.
228. G. Gallego, O. Özer, and P. H. Zipkin. Bounds, heuristics, and approximations for distribution systems. Operations Research, 55(3):503–517, 2007.
229. H. P. Galliher, P. M. Morse, and M. Simond. Dynamics of two classes of continuous‐review inventory systems. Operations Research, 7(3):362–384, 1959.
230. R. D. Galvão. A dual‐bounded algorithm for the p‐median problem. Operations Research, 28(5):1112–1121, 1980.
231. R. D. Galvão and C. ReVelle. A Lagrangean heuristic for the maximal covering location problem. European Journal of Operational Research, 88:114–123, 1996.
232. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP‐Completeness. W. H. Freeman and Company, New York, 1979.
233. R. S. Garfinkel, A. W. Neebe, and M. R. Rao. An algorithm for the m‐median plant location problem. Transportation Science, 8(3):217–236, 1974.
234. L. Garrow. Discrete Choice Modelling and Air Travel Demand: Theory and Applications. Routledge, New York, 2010.
235. Gartner, Inc. Gartner announces rankings of the 2016 supply chain top 25, May 19, 2016. URL http://www.gartner.com/newsroom/id/3323617.
236. T. J. Gaskell. Bases for fleet scheduling. Operational Research Quarterly, 18: 281–295, 1967.
237. B. Gavish and K. Altinkemer. Backbone network design tools with economic tradeoffs. ORSA Journal on Computing, 2(3):236–252, 1990.
238. S. Geary, S. M. Disney, and D. R. Towill. On bullwhip in supply chains—historical review, present practice and expected future impact. International Journal of Production Economics, 101(1):2–18, 2006.
239. M. Gendreau and J.‐Y. Potvin, editors. Handbook of Metaheuristics. Springer, New York, 2nd edition, 2010.
240. M. Gendreau, A. Hertz, and G. Laporte. New insertion and postoptimization procedures for the traveling salesman problem. Operations Research, 40(6): 1086–1094, 1992.
241. M. Gendreau, A. Hertz, and G. Laporte. A tabu search heuristic for the vehicle routing problem. Management Science, 40(10):1276–1290, 1994.
242. M. Gendreau, G. Laporte, and J.‐Y. Potvin. Metaheuristics for the capacitated VRP. In P. Toth and D. Vigo, editors, The Vehicle Routing Problem, chapter 6, pages 129–154. Society for Industrial and Applied Mathematics, Philadelphia, 2001.
243. M. Gendreau, J.‐Y. Potvin, O. Bräumlaysy, G. Hasle, and A. Løkketangen. Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography. In B. Golden, S. Raghavan, and E. Wasil, editors, The Vehicle Routing Problem: Latest Advances and New Challenges, volume 43 of Operations Research/Computer Science Interfaces, pages 143–169. Springer US, New York, 2008.
244. B. Gendron, T. G. Crainic, and A. Frangioni. Multicommodity capacitated network design. In B. Sansò and P. Soriano, editors, Telecommunications Network Planning, chapter 1, pages 1–19. Springer, New York, 1999.
245. A. Geoffrion and R. McBride. Lagrangean relaxation applied to capacitated facility location problems. AIIE Transactions, 10(1):40–47, 1978.
246. A. M. Geoffrion and G. W. Graves. Multicommodity distribution system design by Benders decomposition. Management Science, 20(5):822–844, 1974.
247. I. Ghamlouche, T. G. Crainic, and M. Gendreau. Cycle‐based neighbourhoods for fixed‐charge capacitated multicommodity network design. Operations Research, 51(4):655–667, 2003.
248. A. Ghosh and C. S. Craig. Formulating retail location strategy in a changing environment. The Journal of Marketing, 47(3):56–68, 1983.
249. B. E. Gillett and L. R. Miller. A heuristic algorithm for the vehicle‐dispatch problem. Operations Research, 22(2):340–349, 1974.
250. P. Gilmore and R. E. Gomory. Multistage cutting stock problems of two and more dimensions. Operations Research, 13(1):94–120, 1965.
251. F. Glover. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13:533–549, 1986.
252. F. Glover. Tabu search—Part I. ORSA Journal on Computing, 1(3):190–206, 1989.
253. F. Glover. Tabu search—Part II. ORSA Journal on Computing, 2(1):4–32, 1990.
254. F. Glover and M. Laguna. Tabu Search. Kluwer, Boston, 1997.
255. M. X. Goemans. Worst‐case comparison of valid inequalities for the TSP. Mathematical Programming, 69:335–349, 1995.
256. M. X. Goemans and D. P. Williamson. The primal‐dual method for approximation algorithms and its application to network design problems. In D. S. Hochbaum, editor, Approximation Algorithms for NP‐Hard Problems, chapter 4, pages 144–191. PWS Publishing Co., Boston, MA, 1997.
257. M. Goetschalckx and C. Jacobs‐Blecha. The vehicle routing problem with backhauls. European Journal of Operational Research, 42:39–51, 1989.
258. D. A. Goldberg, D. A. Katz‐Rogozhnikov, Y. Lu, M. Sharma, and M. S. Squillante. Asymptotic optimality of constant‐order policies for lost sales inventory models with large lead times. Mathematics of Operations Research, 41(3): 898–913, 2016.
259. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison‐Wesley, Reading, MA, 1989.
260. B. Golden, S. Raghavan, and E. Wasil, editors. The Vehicle Routing Problem: Latest Advances and New Challenges, volume 43 of Operations Research/Computer Science Interfaces. Springer US, New York, 2008.
261. B. L. Golden and W. R. Stewart. Empirical analysis of heuristics. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, chapter 7, pages 207–249. John Wiley & Sons, New York, 1985.
262. E. Gourdin, M. Labbé, and H. Yaman. Telecommunication and location. In Z. Drezner and H. W. Hamacher, editors, Facility Location: Applications and Theory, chapter 9, pages 277–307. Springer‐Verlag, New York, 2002.
263. J. E. Graver and M. E. Watkins. Combinatorics with Emphasis on the Theory of Graphs. Springer‐Verlag, New York, 1977.
264. S. C. Graves. A multi‐echelon inventory model for a repairable item with one‐for‐one replenishment. Management Science, 31(10):1247–1256, 1985.
265. S. C. Graves. Safety stocks in manufacturing systems. Journal of Manufacturing and Operations Management, 1:67–101, 1988.
266. S. C. Graves and T. Schoenmeyr. Strategic safety‐stock placement in supply chains with capacity constraints. Manufacturing & Service Operations Management, 18(3):445–460, 2016.
267. S. C. Graves and B. T. Tomlin. Process flexibility in supply chains. Management Science, 49(7):907–919, 2003.
268. S. C. Graves and S. P. Willems. Optimizing strategic safety stock placement in supply chains. Manufacturing & Service Operations Management, 2(1):68–83, 2000.
269. S. C. Graves and S. P. Willems. Supply chain design: Safety stock placement and supply chain configuration. In A. G. de Kok and S. C. Graves, editors, Supply Chain Management: Design, Coordination and Operation, volume 11 of Handbooks in Operations Research and Management Science, chapter 3. Elsevier, Amsterdam, 2003a.
270. S. C. Graves and S. P. Willems. Erratum: Optimization strategic safety stock placement in supply chains. Manufacturing & Service Operations Management, 5(2):176–177, 2003b.
271. A. Grosfeld Nir and Y. Gerchak. Multiple lotsizing in production to order with random yields: Review of recent advances. Annals of Operations Research, 126(1–4):43–69, 2004.
272. M. Grötschel. On the monotone symmetric travelling salesman problem: Hypohamiltonian/hypotraceable graphs and facets. Mathematics of Operations Research, 5(2):285–292, 1980a.
273. M. Grötschel. On the symmetric travelling salesman problem: Solution of a 120‐city problem. In M. W. Padberg, editor, Combinatorial Optimization, volume 12 of Mathematical Programming Studies, pages 61–77. Springer, Berlin, 1980b.
274. M. Grötschel and O. Holland. A cutting plane algorithm for minimum perfect 2‐matchings. Computing, 39(4):327–344, 1987.
275. M. Grötschel and O. Holland. Solution of large‐scale symmetric travelling salesman problems. Mathematical Programming Series B, 51(1–3):141–202, 1991.
276. M. Grötschel and M. W. Padberg. On the symmetric travelling salesman problem II: Lifting theorems and facets. Mathematical Programming Series B, 16(1):281–302, 1979.
277. M. Grötschel and W. R. Pulleyblank. Clique tree inequalities and the symmetric travelling salesman problem. Mathematics of Operations Research, 11(4): 537–569, 1986.
278. M. Guignard and S. Kim. Lagrangean decomposition: A model yielding strong Lagrangean bounds. Mathematical Programming, 39:215–228, 1987.
279. R. Güllü, E. Onol, and N. Erkip. Analysis of a deterministic demand production/inventory system under nonstationary supply uncertainty. IIE Transactions, 29(8):703–709, 1997.
280. R. Güllü, E. Önol, and N. Erkip. Analysis of an inventory system under supply uncertainty. International Journal of Production Economics, 59:377–385, 1999.
281. G. Gunawardane. Dynamic versions of set covering type public facility location problems. European Journal of Operational Research, 10(2):190–195, 1982.
282. O. Günlük. A branch‐and‐cut algorithm for capacitated network design problems. Mathematical Programming, 86(1):17–39, 1999.
283. E. A. Gunn, C. A. MacDonald, A. Friars, and G. Caissie. Scotsburn Dairy Group uses a hierarchical production scheduling and inventory management system to control its ice cream production. Interfaces, 44(3):253–268, 2014.
284. G. Hadley and T. M. Whitin. Analysis of Inventory Systems. Prentice‐Hall, Englewood Cliffs, NJ, 1963.
285. M. Haimovich and A. H. G. Rinnooy Kan. Bounds and heuristics for capacitated routing problems. Mathematics of Operations Research, 10(4):527–542, 1985.
286. S. L. Hakimi. Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Operations Research, 13 (3):462–475, 1965.
287. S. L. Hakimi. On locating new facilities in a competitive environment. European Journal of Operational Research, 12:29–55, 1983.
288. J. Han, Y. Xu, D. Liu, Y. Zhao, Z. Zhao, S. Zhou, T. Deng, M. Xue, J. Ye, and Z.‐J. M. Shen. Operations research enables better planning of natural gas pipelines. INFORMS Journal on Applied Analytics, 49(1):23–39, 2019.
289. P. Hansen and N. Mladenović. Variable neighborhood search for the p‐median. Location Science, 5(4):207–226, 1997.
290. R. Hariharan and P. Zipkin. Customer‐order information, leadtimes, and inventories. Management Science, 41(10):1599–1607, 1995.
291. F. W. Harris. How many parts to make at once. Factory: The Magazine of Management, 10(2):135, 1913. Reprinted in Operations Research 38(6):947–950, 1990.
292. P. Harsha and M. Dahleh. Optimal management and sizing of energy storage under dynamic pricing for the efficient integration of renewable energy. IEEE Transactions on Power Systems, 30(3):1164–1181, 2015.
293. R. M. Harstad and A. S. Pekeč. Relevance to practice and auction theory: A memorial essay for Michael Rothkopf. Interfaces, 38(5):367–380, 2008.
294. M. Hartman, A. B. Martin, N. Espinosa, A. Catlin, and The National Health Expenditure Accounts Team. National health care spending in 2016: Spending and enrollment growth slow after initial coverage expansions. Health Affairs, 37(1):150–160, 2018.
295. A. C. Hax and D. Candea. Production and Inventory Management. Prentice‐Hall, Englewood Cliffs, NJ, 1984.
296. M. Held and R. M. Karp. A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics, 10 (1):196–210, 1962.
297. M. Held and R. M. Karp. The traveling‐salesman problem and minimum spanning trees. Operations Research, 18(6):1138–1162, 1970.
298. M. Held and R. M. Karp. The traveling‐salesman problem and minimum spanning trees: Part II. Mathematical Programming, 1(1):6–25, 1971.
299. J. Henry. BMW says flexible, not lean, is the next big thing in autos. BNET, November 24, 2009.
300. Y. T. Herer, M. Tzur, and E. Yücesan. The multi‐location transshipment problem. IIE Transactions, 38(3):185–200, 2006.
301. J. L. Heskett and S. Signorelli. Benetton (A). Harvard Business School Case, September 13, 1984.
302. I. Higa, A. M. Feyerherm, and A. L. Machado. Waiting time in an inventory system. Operations Research, 23(4):674–680, 1975.
303. T. H. Ho, S. Savin, and C. Terwiesch. Managing demand and sales dynamics in new product diffusion under supply constraint. Management Science, 48(2): 187–206, 2002.
304. K. L. Hoffman, M. Padberg, and G. Rinaldi. Traveling salesman problem. In S. I. Gass and M. C. Fu, editors, Encyclopedia of Operations Research and Management Science, pages 1573–1578. Springer US, New York, 2013.
305. G. Hohner, J. Rich, E. Ng, G. Reid, A. J. Davenport, J. R. Kalagnanam, H. S. Lee, and C. An. Combinatorial and quantity‐discount procurement auctions benefit Mars, Incorporated and its suppliers. Interfaces, 33(1):23–35, 2003.
306. C. Holland, J. Levis, R. Nuggehalli, B. Santilli, and J. Winters. UPS optimizes delivery routes. Interfaces, 47(1):8–23, 2017.
307. J. H. Holland. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, Ann Arbor, MI, 1992.
308. O. Holland. Schnittebenenverfahren für Travelling‐Salesman und verwandte Probleme. Ph.D. dissertation, Universität Bonn, Bonn, Germany, 1987.
309. K. Holmberg and D. Yuan. A Lagrangian heuristic based branch‐and‐bound approach for the capacitated network design problem. Operations Research, 48(3):461–481, 2000.
310. C. C. Holt. Forecasting seasonal and trends by exponentially weighted moving averages. Office of Naval Research Memorandum, No. 52, 1957.
311. S. Hong. A Linear Programming Approach for the Traveling Salesman Problem. Ph.D. dissertation, Johns Hopkins University, Baltimore, MD, 1972.
312. C. M. Hosage and M. F. Goodchild. Discrete space location‐allocation solutions from genetic algorithms. Annals of Operations Research, 6(2):35–46, 1986.
313. H. Hotelling. Stability in competition. The Economic Journal, 39(153):41–57, 1929.
314. M. Huang, K. Smilowitz, and B. Balcik. Models for relief routing: Equity, efficiency and efficacy. Transportation Research Part E: Logistics and Transportation Review, 48(1):2–18, 2012.
315. W. T. Huh, G. Janakiraman, J. A. Muckstadt, and P. Rusmevichientong. Asymptotic optimality of order‐up‐to policies in lost sales inventory systems. Management Science, 55(3):404–420, 2009.
316. S. Humair and S. P. Willems. Technical note: Optimizing strategic safety stock placement in general acyclic networks. Operations Research, 59(3):781–787, 2011.
317. S. Humair, J. D. Ruark, B. Tomlin, and S. P. Willems. Incorporating stochastic lead times into the guaranteed service model of safety stock optimization. Interfaces, 43(5):421–434, 2013.
318. T. Ida and T. Kuroda. Discrete choice model analysis of demand for mobile telephone service in Japan. Empirical Economics, 36:65–80, 2009.
319. K. Inderfurth. Safety stock optimization in multi‐stage inventory systems. International Journal of Production Economics, 24:103–113, 1991.
320. K. Inderfurth and S. Minner. Safety stocks in multi‐stage inventory systems under different service measures. European Journal of Operational Research, 106:57–73, 1998.
321. INFORMS. MISO applies operations research to energy and ancillary services markets unlocking billions of saving, 2011. URL https://www.informs.org/Impact/O.R.‐Analytics‐Success‐Stories/MISO‐Applies‐O.R.‐to‐Energy‐and‐Ancillary‐Services‐Markets.
322. INFORMS. 2018 INFORMS Franz Edelman Award finalists selected from leading analytics teams around the world, 2018. URL https://www.informs.org/About‐INFORMS/News‐Room/Press‐Releases/2018‐INFORMS‐Franz‐Edelman‐Award‐finalists‐selected‐from‐leading‐analytics‐teams‐around‐the‐world.
323. T. Islam. Household level innovation diffusion model of photo‐voltaic (PV) solar cells from stated preference data. Energy Policy, 65(Supplement C):340–350, 2014.
324. G. James, D. Witten, T. Hastie, and R. Tibshirani. An Introduction to Statistical Learning with Applications in R. Springer, New York, 2013.
325. J. H. Jaramillo, J. Bhadury, and R. Batta. On the use of genetic algorithms to solve location problems. Computers & Operations Research, 29(6):761–779, 2002.
326. M. Jeger and O. Kariv. Algorithms for finding P‐centers on a weighted tree (for relatively small P). Networks, 15(3):381–389, 1985.
327. D. S. Johnson. Local optimization and the traveling salesman problem. In Proceedings of the 17th Colloquium on Automata, Languages, and Programming, pages 446–461, Berlin, 1995.
328. D. S. Johnson and L. A. McGeoch. The traveling salesman problem: A case study in local optimization. In E. H. L. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 215–310. John Wiley & Sons, New York, 1997.
329. M. E. Johnson, H. L. Lee, T. Davis, and R. Hall. Expressions for item fill rates in periodic inventory systems. Naval Research Logistics, 42:57–80, 1995.
330. M. P. Johnson. Single‐period location models for subsidized housing: Project‐based subsidies. Socio‐Economic Planning Sciences, 40:249–274, 2006.
331. M. P. Johnson and K. Smilowitz. Community‐based operations research. In T. Klastorin, editor, Tutorials in Operations Research, chapter 6, pages 102–123. INFORMS, Hanover, MD, 2007.
332. W. C. Jordan and S. C. Graves. Principles on the benefits of manufacturing process flexibility. Management Science, 41(4):577–594, 1995.
333. M. Jünger and W. R. Pulleyblank. Geometric duality and combinatorial optimization. In S. D. Chatterji, B. Fuchssteiner, and U. Kulisch, editors, Jahrbuch Überblicke Mathematik, pages 1–24. Vieweg, Brundschweig/Wiesbaden, Germany, 1993.
334. M. Jünger, M. Schulz, and W. Zychowicz. GEODUAL. Software, 2009. URL https://informatik.uni‐koeln.de/ls‐juenger/geodual.
335. Kaggle.com. Retail data analytics [data set], September 2017. URL https://www.kaggle.com/manjeetsingh/retaildataset.
336. J. Kalagnanam and D. C. Parkes. Auctions, bidding and exchange design. In D. Simchi‐Levi, S. D. Wu, and Z.‐J. M. Shen, editors, Handbook of Quantitative Supply Chain Analysis: Modeling in the E‐Business Era, chapter 5. Springer, New York, 2004.
337. L. V. Kantorovich. Mathematical methods of organizing and planning production. Management Science, 6(4):366–422, 1960.
338. R. Kapuscinski, R. Q. Zhang, P. Carbonneau, R. Moore, and B. Reeves. Inventory decisions in Dell's supply chain. Interfaces, 34(3):191–205, 2004.
339. B. Y. Kara and M. R. Taner. Hub location problems: The location of interacting facilities. In H. A. Eiselt and V. Marianov, editors, Foundations of Location Analysis, chapter 12, pages 273–288. Springer‐Verlag, Berlin, 2011.
340. R. L. Karg and G. L. Thompson. A heuristic approach to solving travelling salesman problems. Management Science, 10(2):225–248, 1964.
341. O. Kariv and S. L. Hakimi. An algorithmic approach to network location problems. I: The p‐centers. SIAM Journal on Applied Mathematics, 37(3): 513–538, 1979a.
342. O. Kariv and S. L. Hakimi. An algorithmic approach to network location problems. II: The p‐medians. SIAM Journal on Applied Mathematics, 37(3): 539–560, 1979b.
343. S. Karlin. Optimal inventory policy for the Arrow‐Harris‐Marschak dynamic model. In K. J. Arrow, S. Karlin, and H. Scarf, editors, Studies in the Mathematical Theory of Inventory and Production, chapter 9, pages 135–154. Stanford University Press, Stanford, CA, 1958a.
344. S. Karlin. One stage inventory models with uncertainty. In K. J. Arrow, S. Karlin, and H. Scarf, editors, Studies in the Mathematical Theory of Inventory and Production, chapter 8, pages 109–134. Stanford University Press, Stanford, CA, 1958b.
345. S. Karlin. Dynamic inventory policy with varying stochastic demands. Management Science, 6(3):231–258, 1960.
346. S. Karlin and H. Scarf. Inventory models of the Arrow‐Harris‐Marschak type with time lag. In K. J. Arrow, S. Karlin, and H. Scarf, editors, Studies in the Mathematical Theory of Inventory and Production, chapter 10, pages 155–178. Stanford University Press, Stanford, CA, 1958.
347. R. M. Karp and J. M. Steele. Probabilistic analysis of heuristics. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, chapter 6, pages 181–205. John Wiley & Sons, Hoboken, NJ, 1985.
348. M. Karpinski, M. Lampis, and R. Schmied. New inapproximability bounds for TSP. In L. Cai, S.‐W. Cheng, and T.‐W. Lam, editors, Algorithms and Computation, volume 8283 of Lecture Notes in Computer Science, pages 568–578. Springer, Berlin, 2013.
349. T. T. Ke, Z.‐J. M. Shen, and S. Li. How inventory cost influences introduction timing of product line extensions. Production and Operations Management, 22(5):1214–1231, 2013.
350. J. Khawam, W. H. Hausman, and D. W. Cheng. Warranty inventory optimization for Hitachi Global Storage Technologies, Inc. Interfaces, 37(5):455–471, 2007.
351. J. H. Kim and W. B. Powell. Optimal energy commitments with storage and intermittent supply. Operations Research, 59(6):1347–1360, 2011.
352. G. E. Kimball. General principles of inventory control. Journal of Manufacturing and Operations Management, 1:119–130, 1988.
353. J. G. Klincewicz and H. Luss. A Lagrangian relaxation heuristic for capacitated facility location with single‐source constraints. Journal of the Operational Research Society, 37(5):495–500, 1986.
354. N. Kohl. Exact Methods for Time Constrained Routing and Related Scheduling Problems. Ph.D. dissertation, Technical University of Denmark, Lyngby, Denmark, 1995.
355. N. Kohl and O. B. G. Madsen. An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Operations Research, 45(3):395–406, 1997.
356. F. Koppelman. Travel prediction with models of individualistic choice behavior. Technical report, Department of Civil Engineering, MIT, Cambridge, MA, 1975.
357. M. Körkel. On the exact solution of large‐scale simple plant location problems. European Journal of Operational Research, 39(2):157–173, 1989.
358. M. Korpaas, A. T. Holen, and R. Hildrum. Operation and sizing of energy storage for wind power plants in a market system. Electrical Power and Energy Systems, 25:599–606, 2003.
359. K. Krishnan and V. R. K. Rao. Inventory control in N warehouses. Journal of Industrial Engineering, 16:212–215, 1965.
360. J. B. Kruskal, Jr. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7(1): 48–50, 1956.
361. M. J. Kuby. Programming models for facility dispersion: The p‐dispersion and maxisum dispersion problems. Geographical Analysis, 19:315–329, 1987.
362. A. A. Kuehn and M. J. Hamburger. A heuristic program for locating warehouses. Management Science, 9(4):643–666, 1963.
363. S. Kunnumkal and H. Topaloglu. A duality‐based relaxation and decomposition approach for inventory distribution systems. Naval Research Logistics, 55(7): 612–631, 2008.
364. Y.‐J. Kuo and H. D. Mittelmann. Interior point methods for second‐order cone programming and OR applications. Computational Optimization and Applications, 28(3):255–285, 2004.
365. A. A. Kurawarwala and H. Matsuo. Forecasting and inventory management of short life‐cycle products. Operations Research, 44(1):131–150, 1996.
366. G. Laporte. The traveling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(2): 231–247, 1992a.
367. G. Laporte. The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(3):345–358, 1992b.
368. G. Laporte. A concise guide to the traveling salesman problem. Journal of the Operational Research Society, 61:35–40, 2010.
369. G. Laporte and Y. Nobert. An exact algorithm for minimizing routing and operating cost in depot location. European Journal of Operational Research, 6(2):224–226, 1981.
370. G. Laporte and Y. Nobert. Comb inequalities for the vehicle routing problem. Methods of Operations Research, 51:271–276, 1984.
371. G. Laporte and Y. Nobert. Exact algorithms for the vehicle routing problem. In S. Martello, G. Laporte, M. Minoux, and C. Ribeiro, editors, Surveys in Combinatorial Optimization, volume 132 of North‐Holland Mathematics Studies, pages 147–184. North‐Holland, Amsterdam, 1987.
372. G. Laporte and F. Semet. Classical heuristics for the capacitated VRP. In P. Toth and D. Vigo, editors, The Vehicle Routing Problem, chapter 5, pages 109–128. Society for Industrial and Applied Mathematics, Philadelphia, 2001.
373. G. Laporte, Y. Nobert, and M. Desrochers. Optimal routing under capacity and distance restrictions. Operations Research, 33(5):1050–1073, 1985.
374. G. Laporte, Y. Nobert, and D. A. Arpin. An exact algorithm for solving a capacitated location‐routing problem. Annals of Operations Research, 6(9): 291–310, 1986.
375. G. Laporte, M. Gendreau, J.‐Y. Potvin, and F. Semet. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research, 7(4–5):285–300, 2000.
376. M. A. Lariviere. A note on probability distributions with increasing generalized failure rates. Operations Research, 54(3):602–604, 2006.
377. M. A. Lariviere and E. L. Porteus. Selling to the newsvendor: An analysis of price‐only contracts. Manufacturing & Service Operations Management, 3(4): 293–305, 2001.
378. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, Hoboken, NJ, 1985.
379. D. Lawrence. Bridging the quality chasm. In P. P. Reid, W. D. Compton, J. H. Grossman, and G. Fanjiang, editors, Building a Better Delivery System: A New Engineering/Health Care Partnership. National Academies Press, Washington, DC, 2005.
380. F.‐X. Le Louarn, M. Gendreau, and J.‐Y. Potvin. GENI ants for the traveling salesman problem. Annals of Operations Research, 131(1–4):187–201, 2004.
381. H. L. Lee. Effective inventory and service management through product and process redesign. Operations Research, 44(1):151–159, 1996.
382. H. L. Lee and C. Billington. Material management in decentralized supply chains. Operations Research, 41(5):835–847, 1993.
383. H. L. Lee, V. Padmanabhan, and S. Whang. Information distortion in a supply chain: The bullwhip effect. Management Science, 43(4):546–558, 1997a.
384. H. L. Lee, V. Padmanabhan, and S. Whang. The bullwhip effect in supply chains. Sloan Management Review, 38(3):93–102, 1997b.
385. H. L. Lee, V. Padmanabhan, and S. Whang. Comments on “Information distortion in a supply chain: The bullwhip effect”. Management Science, 50 (12S):1887–1893, 2004.
386. E. Lesnaia. Optimizing Safety Stock Placement in General Network Supply Chains. Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, September 2004.
387. A. N. Letchford, G. Reinelt, and D. O. Theis. A faster exact separation algorithm for blossom inequalities. In D. Bienstock and G. Nemhauser, editors, Integer Programming and Combinatorial Optimization, volume 3064 of Lecture Notes in Computer Science. Springer, Berlin, 2004.
388. R. Levi, G. Janakiraman, and M. Nagarajan. A 2‐approximation algorithm for stochastic inventory control models with lost sales. Mathematics of Operations Research, 33(2):351–374, 2008.
389. C.‐L. Li and D. Simchi‐Levi. Worst‐case analysis of heuristics for multidepot capacitated vehicle routing problems. ORSA Journal on Computing, 2(1): 64–73, 1990.
390. X. Li and Y. Ouyang. A continuum approximation approach to reliable facility location design under correlated probabilistic disruptions. Transportation Research–Part B, 44(4):535–548, 2010.
391. R. W. Lien, S. M. R. Iravani, K. Smilowitz, and M. Tzur. An efficient and robust design for transshipment networks. Production and Operations Management, 20(5):699–713, 2011.
392. G. L. Lilien and A. Rangaswamy. Marketing Engineering: Computer‐Assistend Marketing Analysis and Planning. Addison‐Wesley Educational Publishers, Reading, MA, 1998.
393. G. L. Lilien, A. Rangaswamy, and A. D. Bruyn. Principles of Marketing Engineering. Trafford Publishing, Victoria, BC, Canada, 2007.
394. M. Lim, A. Bassamboo, S. Chopra, and M. S. Daskin. Use of chaining strategies in the presence of disruption risks. Working paper, University of Illinois, Champaign, 2012.
395. S. Lin. Computer solutions of the traveling salesman problem. Bell System Technical Journal, 44:2245–2269, 1965.
396. S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling‐salesman problem. Operations Research, 21:498–516, 1973.
397. K. Linebaugh. Honda's flexible plants provide edge. Wall Street Journal, September 23, 2008.
398. J. D. C. Little, K. G. Murty, D. W. Sweeney, and C. Karel. An algorithm for the traveling salesman problem. Operations Research, 11(6):972–989, 1963.
399. M. E. Lübbecke and J. Desrosiers. Selected topics in column generation. Operations Research, 53(6):1007–1023, 2005.
400. S. Luke. Essentials of Metaheuristics. Lulu, 2nd edition, 2013. URL http://cs.gmu.edu/˜sean/book/metaheuristics.
401. T. L. Magnanti and R. T. Wong. Network design and transportation planning: Models and algorithms. Transportation Science, 18(1):1–55, 1984.
402. T. L. Magnanti, P. Mireault, and R. T. Wong. Tailoring Benders decomposition for uncapacitated network design. Mathematical Programming Study, 26: 112–154, 1986.
403. T. L. Magnanti, Z.‐J. M. Shen, J. Shu, D. Simchi‐Levi, and C.‐P. Teo. Inventory placement in acyclic supply chain networks. Operations Research Letters, 34: 228–238, 2006.
404. V. Mahajan, E. Muller, and F. M. Bass. Diffusion of new products: Empirical generalizations and managerial uses. Marketing Science, 14(3S):G79–G88, 1995.
405. H. Mak and Z.‐J. M. Shen. Stochastic programming approach to process flexibility design. Flexible Services and Manufacturing Journal, 21(3):75–91, 2009.
406. A. S. Manne. Plant location under economies‐of‐scale—decentralization and computation. Management Science, 11(2):213–235, 1964.
407. F. E. Maranzana. On the location of supply points to minimize transport costs. Operational Research Quarterly, 15(3):261–270, 1964.
408. O. Martin, S. W. Otto, and E. W. Felten. Large‐step Markov chains for the traveling salesman problem. Complex Systems, 5:299–326, 1991.
409. A. McAfee and E. Brynjolfsson. Big data: The management revolution. Harvard Business Review, 90(12):16–17, 2012.
410. S. T. McCormick, M. R. Rao, and G. Rinaldi. Easy and difficult objective functions for max cut. Mathematical Programming, 94(2–3):459–466, 2003.
411. P. McCullen and D. Towill. Diagnosis and reduction of bullwhip in supply chains. Supply Chain Management, 7(3):164–179, 2002.
412. D. McCutcheon. Flexible manufacturing: IBM's Bromont semiconductor packaging plant. Canadian Electronics, 19(7):26, 2004.
413. D. L. McFadden. Conditional Logit Analysis of Qualitative Choice Behavior. Academic Press, New York, 1974.
414. D. L. McFadden. Econometric analysis of qualitative response models. In Handbook of Econometrics, volume 2. Elsevier Science Publishers BV, New York, 1984.
415. L. A. McLay. Discrete optimization models for homeland security and disaster management. In D. Aleman and A. Thiele, editors, INFORMS Tutorials in Operations Research, pages 111–132. INFORMS, Hanover, MD, 2015.
416. L. A. McLay, S. H. Jacobson, and J. E. Kobza. A multilevel passenger screening problem for aviation security. Naval Research Logistics, 53:183–197, 2006.
417. L. A. McLay, S. H. Jacobson, and A. G. Nikolaev. A sequential stochastic passenger screening problem for aviation security. IIE Transactions, 41(6): 575–591, 2009.
418. L. A. McLay, A. J. Lee, and S. H. Jacobson. Risk‐based policies for airport security checkpoint screening. Transportation Science, 44(3):333–349, 2010.
419. N. Megiddo, A. Tamir, E. Zemel, and R. Chandrasekaran. An algorithm for the kth longest path in a tree with applications to location problems. SIAM Journal on Computing, 10(2):328–337, 1981.
420. N. Megiddo, E. Zemel, and S. L. Hakimi. The maximum coverage location problem. SIAM Journal of Algebraic and Discrete Methods, 4(2):253–261, 1983.
421. M. J. Meixell and S. D. Wu. Scenario analysis of demand in a technology market using leading indicators. IEEE Transactions on Semiconductor Manufacturing, 14(1):65–75, 2001.
422. E. Melachrinoudis. The location of undesirable facilities. In H. A. Eiselt and V. Marianov, editors, Foundations of Location Analysis, chapter 10, pages 207–239. Springer‐Verlag, Berlin, 2011.
423. C. E. Miller, A. W. Tucker, and R. A. Zemlin. Integer programming formulation of traveling salesman problems. Journal of the ACM, 7(4):326–329, 1960.
424. D. L. Miller. A matching based exact algorithm for capacitated vehicle routing problems. ORSA Journal on Computing, 7(1):1–9, 1995.
425. D. L. Miller and J. F. Pekny. A staged primal‐dual algorithm for perfect b‐matching with edge capacities. ORSA Journal on Computing, 7(3):298–320, 1995.
426. A. Mingozzi, S. Giorgi, and R. Baldacci. An exact method for the vehicle routing problem with backhauls. Transportation Science, 33:315–329, 1999.
427. E. Minieka. The m‐center problem. SIAM Review, 12(1):138–139, 1970.
428. S. Minner. Dynamic programming algorithms for multi‐stage safety stock optimization. Operations Research Spektrum, 19(4):261–271, 1997.
429. P. B. Mirchandani. Locational decisions on stochastic networks. Geographical Analysis, 12(2):172–183, 1980.
430. P. B. Mirchandani and R. L. Francis, editors. Discrete Location Theory. Wiley‐Interscience, New York, 1990.
431. P. B. Mirchandani, A. Oudjit, and R. T. Wong. “Multidimensional” extensions and a nested dual approach for the m‐median problem. European Journal of Operational Research, 21(1):121–137, 1985.
432. A. Mirzaian. Lagrangian relaxation for the star‐star concentrator location problem: Approximation algorithm and bounds. Networks, 15:1–20, 1985.
433. N. Mladenović and P. Hansen. Variable neighborhood search. Computers and Operations Research, 24(11):1097–1100, 1997.
434. N. Mladenovic, J. Brimberg, P. Hansen, and J. A. Moreno‐Pérez. The p‐median problem: A survey of metaheuristic approaches. European Journal of Operational Research, 179(3):927–939, 2007.
435. J. G. Morris. On the extent to which certain fixed‐charge depot location problems can be solved by LP. Journal of the Operational Research Society, 29(1):71–76, 1978.
436. P. Morse and G. Kimball. Methods of Operations Research. Technology Press of MIT, Cambridge, MA, 1951.
437. T. E. Morton. Bounds on the solution of the lagged optimal inventory equation with no demand backlogging and proportional costs. SIAM Review, 11(4): 572–596, 1969.
438. M. Mourgaya and F. Vanderbeck. Column generation based heuristic for tactical planning in multi‐period vehicle routing. European Journal of Operational Research, 183(3):1028–1041, 2007.
439. J. A. Muckstadt and R. O. Roundy. Analysis of multistage production systems. In S. C. Graves, A. H. G. Rinnooy Kan, and P. H. Zipkin, editors, Handbooks in Operations Research and Management Science, vol. 4: Logistics of Production and Inventory, chapter 2, pages 59–131. Elsevier, New York, 1993.
440. R. B. Myerson and M. A. Satterthwaite. Efficient mechanisms for bilateral trading. Journal of Economic Theory, 29(2):265–281, 1983.
441. D. Naddef and G. Rinaldi. The graphical relaxation: A new framework for the symmetric traveling salesman polytope. Mathematical Programming, 58(1): 53–88, 1993.
442. D. Naddef and G. Rinaldi. Branch‐and‐cut algorithms for the capacitated VRP. In P. Toth and D. Vigo, editors, The Vehicle Routing Problem, chapter 3, pages 53–84. Society for Industrial and Applied Mathematics, Philadelphia, 2001.
443. Y. Nagata and O. Bräysy. Edge assembly‐based memetic algorithm for the capacitated vehicle routing problem. Networks, 54(4):205–215, 2009.
444. Y. Nagata and S. Kobayashi. Edge assembly crossover: A high‐power genetic algorithm for the traveling salesman problem. In Proceedings of the 7th International Conference on Genetic Algorithms, pages 450–457, East Lansing, MI, 1997. Morgan Kaufmann Publishers.
445. G. Nagy and S. Salhi. Location‐routing: Issues, models and methods. European Journal of Operational Research, 177(2):649–672, 2007.
446. S. Nahmias. Optimal ordering policies for perishable inventory—II. Operations Research, 23(4):735–749, 1975.
447. S. Nahmias. Simple approximations for a variety of dynamic leadtime lost‐sales inventory models. Operations Research, 27(5):904–924, 1979.
448. S. Nahmias. Production and Operations Analysis. McGraw‐Hill/Irwin, New York, 5th edition, 2005.
449. S. Nahmias and W. P. Pierskalla. Optimal ordering policies for a product that perishes in two periods subject to stochastic demand. Naval Research Logistics Quarterly, 20:207–229, 1973.
450. P. Nandakumar and T. E. Morton. Near myopic heuristics for the fixed‐life perishability problem. Management Science, 39(12):1490–1498, 1993.
451. H. Naseraldin and Y. T. Herer. Integrating the number and location of retail outlets on a line with replenishment decisions. Management Science, 54(9): 1666–1683, 2008.
452. National Academy of Engineering (US) and Institute of Medicine (US) Committee on Engineering and the Health Care System. A new partnership between systems engineering and health care. In P. P. Reid, W. D. Compton, J. H. Grossman, and G. Fanjiang, editors, Building a Better Delivery System: A New Engineering/Health Care Partnership, chapter 1. National Academies Press, Washington, DC, 2005.
453. National Fire Protection Association, Inc. NPFA 1710: Standard for the organization and deployment of fire suppression operations, emergency medical operations, and special operations to the public by career fire departments. Quincy, MA, 2001.
454. National Oceanic and Atmospheric Administration (NOAA). Climate data online [data set], 2017. URL https://www.ncdc.noaa.gov/cdo‐web.
455. R. M. Nauss. An improved algorithm for the capacitated facility location problem. Journal of the Operational Research Society, 29(12):1195–1201, 1978.
456. R. M. Nauss and R. E. Markland. Theory and application of an optimizing procedure for lock box location analysis. Management Science, 27:855–865, 1981.
457. A. G. Nikolaev, S. H. Jacobson, and L. A. McLay. A sequential stochastic security system design problem for aviation security. Transportation Science, 41(2): 182–194, 2007.
458. J. P. Norback and R. F. Love. Geometric approaches to solving the traveling salesman problem. Management Science, 23(11):1208–1223, 1977.
459. L. K. Nozick and M. A. Turnquist. Inventory, transportation, service quality and the location of distribution centers. European Journal of Operational Research, 129:362–371, 2001a.
460. L. K. Nozick and M. A. Turnquist. A two‐echelon inventory allocation and distribution center location analysis. Transportation Research Part E, 37: 421–441, 2001b.
461. NYC OpenData. Fire incident dispatch data [data set], October 2, 2017. URL https://data.cityofnewyork.us/Public‐Safety/Fire‐Incident‐Dispatch‐Data/8m42‐w767.
462. M. E. O'Kelly. A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32:393–404, 1987.
463. G. C. Oliveira, A. P. C. Costa, and S. Binato. Large scale transmission network planning using optimization and heuristic techniques. IEEE Transactions on Power Systems, 10(4):1828–1834, 1995.
464. H. L. Ong and J. Moore. Worst‐case analysis of two travelling salesman heuristics. Operations Research Letters, 2(6):273–277, 1984.
465. I. Or. Travelling Salesman‐Type Combinatorial Problems and Their Relation to the Logistics of Blood‐Banking. Ph.D. dissertation, Northwestern University, Evanston, IL, 1976.
466. M. J. Osborne. An Introduction to Game Theory. Oxford University Press, New York, 2003.
467. I. H. Osman. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41(4):421–451, 1993.
468. S. H. Owen and M. S. Daskin. Strategic facility location: A review. European Journal of Operational Research, 111(3):423–447, 1998.
469. O. Özer and H. Xiong. Stock positioning and performance estimation for distribution systems with service constraints. IIE Transactions, 40(12): 1141–1157, 2008.
470. L. Ozsen, C. R. Coullard, and M. S. Daskin. Capacitated warehouse location model with risk pooling. Naval Research Logistics, 55(4):295–312, 2008.
471. M. Padberg and S. Hong. On the symmetric travelling salesman problem: A computational study. Mathematical Programming Study, 12:78–107, 1980.
472. M. Padberg and G. Rinaldi. Optimization of a 532‐city symmetric traveling salesman problem by branch and cut. Operations Research Letters, 6(1):1–7, 1987.
473. M. Padberg and G. Rinaldi. An efficient algorithm for the minimum capacity cut problem. Mathematical Programming Series B, 47(1–3):19–36, 1990a.
474. M. Padberg and G. Rinaldi. Facet identification for the symmetric traveling salesman polytope. Mathematical Programming Series B, 47(1–3):219–257, 1990b.
475. M. Padberg and G. Rinaldi. A branch‐and‐cut algorithm for the resolution of large‐scale symmetric traveling salesman problems. SIAM Review, 33(1): 60–100, 1991.
476. M. W. Padberg and M. R. Rao. Odd minimum cut‐sets and b‐matchings. Mathematics of Operations Research, 7(1):67–80, 1982.
477. N. Padhy. Unit commitment—a bibliographical survey. IEEE Transactions on Power Systems, 19(2):1196–1205, 2004.
478. C. H. Papadimitriou. The Euclidean travelling salesman problem is NP‐complete. Theoretical Computer Science, 4(3):237–244, 1977.
479. M. Parlar and D. Berkin. Future supply uncertainty in EOQ models. Naval Research Logistics, 38(1):107–121, 1991.
480. B. A. Pasternack. Optimal pricing and return policies for perishable commodities. Marketing Science, 4(2):166–176, 1985.
481. A. Paul. A note on closure properties of failure rate distributions. Operations Research, 53(4):733–734, 2005.
482. E. Paz‐Frankel. Truck driver turnover reaches record level. Memphis Business Journal, April 2, 2006.
483. G. Perakis and G. Roels. The price of anarchy in supply chains: Quantifying the efficiency of price‐only contracts. Management Science, 53(8):1249–1268, 2007.
484. J. Perl and M. S. Daskin. A warehouse location‐routing problem. Transportation Research Part B, 19B(5):381–396, 1985.
485. M. Phelan. Ford speeds changeovers in engine production. Knight Ridder Tribune Business News, Washington, November 6, 2002.
486. H. Pirkul and V. Jayaraman. Production, transportation, and distribution planning in a multi‐commodity tri‐echelon system. Transportation Science, 30(4):291–302, 1996.
487. Y. Pochet and L. Wolsey. Algorithms and reformulations for lot sizing problems. CORE discussion paper 9427, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE), 1995.
488. Y. Pochet and L. Wolsey. Production Planning by Mixed Integer Programming. Springer‐Verlag, New York, 2006.
489. E. L. Porteus. The newsvendor problem. In D. Chhajed and T. J. Lowe, editors, Building Intuition: Insights From Basic Operations Management Models and Principles, chapter 7, pages 115–134. Springer, New York, 2008.
490. J.‐Y. Potvin. State‐of‐the art review—evolutionary algorithms for vehicle routing. INFORMS Journal on Computing, 21(4):518–548, 2009.
491. W. B. Powell. A local improvement heuristic for the design of less‐than‐truckload motor carrier networks. Transportation Science, 20(4):246–257, 1986.
492. G. P. Prastacos. Blood inventory management: An overview of theory and practice. Management Science, 30(7):777–800, 1984.
493. R. C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36(6):1389–1401, 1957.
494. C. Prodhon and C. Prins. A survey of recent research on location‐routing problems. European Journal of Operational Research, 238(1):1–17, 2014.
495. L. Qi, Z.‐J. M. Shen, and L. V. Snyder. The effect of supply disruptions on supply chain design decisions. Transportation Science, 44(2):274–289, 2010.
496. W. Qi, Y. Liang, and Z.‐J. M. Shen. Joint planning of energy storage and transmission for wind energy generation. Operations Research, 63(6): 1280–1293, 2015.
497. T. K. Ralphs, L. Kopman, W. R. Pulleyblank, and L. E. Trotter Jr. On the capacitated vehicle routing problem. Mathematical Programming, 94: 343–359, 2003.
498. M. Ramming. Network Knowledge and Route Choice. Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 2001.
499. J. Reese. Solution methods for the p‐median problem: An annotated bibliography. Networks, 48(3):125–142, 2006.
500. C. Rego. A subpath ejection method for the vehicle routing problem. Management Science, 44(10):1447–1459, 1998.
501. C. Rego and C. Roucairol. A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In I. H. Osman and J. P. Kelly, editors, Meta‐Heuristics: Theory and Applications, pages 661–675. Springer US, New York, 1996.
502. G. Reinelt. TSPLIB—a traveling salesman problem library. ORSA Journal on Computing, 3(4):376–384, 1991.
503. J. Renaud, F. F. Boctor, and G. Laporte. An improved petal heuristic for the vehicle routeing problem. Journal of the Operational Research Society, 47(2): 329–336, 1996.
504. C. ReVelle. The maximum capture or “sphere of influence” location problem: Hotelling revisited on a network. Journal of Regional Science, 26(2):343–358, 1986.
505. C. Revelle, D. Marks, and J. C. Liebman. An analysis of private and public sector location models. Management Science, 16(11):692–707, 1970.
506. C. ReVelle, M. Scholssberg, and J. Williams. Solving the maximal covering location problem with heuristic concentration. Computers & Operations Research, 35(2):427–435, 2008a.
507. C. S. ReVelle and R. W. Swain. Central facilities location. Geographical Analysis, 2:30–42, 1970.
508. C. S. ReVelle, H. A. Eiselt, and M. S. Daskin. A bibliography for some fundamental problem categories in discrete location science. European Journal of Operational Research, 184(3):817–848, 2008b.
509. L. W. Robinson. Optimal and approximate policies in multiperiod, multilocation inventory models with transshipments. Operations Research, 38(2):278–295, 1990.
510. Y. Rochat and E. D. Taillard. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1(1):147–167, 1995.
511. R. Romero, R. A. Gallego, and A. Monticelli. Transmission system expansion planning by simulated annealing. In Proceedings of Power Industry Computer Applications Conference, pages 278–283, Salt Lake City, UT, 1995. IEEE.
512. Y. Rong, Z. Atan, and L. V. Snyder. Heuristics for base‐stock levels in multi‐echelon distribution networks. Production and Operations Management, 26(9):1760–1777, 2017a.
513. Y. Rong, L. V. Snyder, and Z.‐J. M. Shen. Bullwhip and reverse bullwhip effects under the rationing game. Naval Research Logistics, 64(3):203–216, 2017b.
514. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis II. An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing, 6(3):563–581, 1977.
515. K. E. Rosing, C. S. Revelle, and H. Rosing‐Vogelaar. The p‐median and its linear programming relaxation: An approach to large problems. Journal of the Operational Research Society, 30(9):815–823, 1979.
516. K. Rosling. Optimal inventory policies for assembly systems under random demands. Operations Research, 37(4):565–579, 1989.
517. S. M. Ross. Stochastic Processes. John Wiley & Sons, New York, 2nd edition, 1996.
518. R. Roundy. 98%‐effective integer‐ratio lot‐sizing for one‐warehouse multi‐retailer systems. Management Science, 31(11):1416–1430, 1985.
519. P. Rusmevichientong, Z.‐J. M. Shen, and D. B. Shmoys. Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Operations Research, 58(6):1666–1680, 2010.
520. R. Russell and W. Igo. An assignment routing problem. Networks, 9(1):1–17, 1979.
521. R. A. Russell. An effective heuristic for the m‐tour traveling salesman problem with some side conditions. Operations Research, 25(3):517–524, 1977.
522. J. K. Ryan. Analysis of Inventory Models with Limited Demand Information. Ph.D. dissertation, Northwestern University, Department of Industrial Engineering and Management Sciences, Evanston, IL, 1997.
523. S. Sahni and T. Gonzalez. P‐complete approximation problems. Journal of the ACM, 23(3):555–565, 1976.
524. M. W. P. Savelsbergh. Local search in routing problems with time windows. Annals of Operations Research, 4(1):285–305, 1985.
525. S. Savin and C. Terwiesch. Optimal product launch times in a duopoly: Balancing life‐cycle revenues with product cost. Operations Research, 53(1): 26–47, 2005.
526. H. Scarf. The optimality of policies in the dynamic inventory problem. In K. Arrow, S. Karlin, and P. Suppes, editors, Mathematical Methods in the Social Sciences, chapter 13. Stanford University Press, Stanford, CA, 1960.
527. F. Schalekamp, D. P. Williamson, and A. van Zuylen. 2‐matchings, the traveling salesman problem, and the subtour LP: A proof of the Boyd‐Carr conjecture. Mathematics of Operations Research, 39(2):403–417, 2014.
528. D. A. Schilling. Dynamic location modeling for public‐sector facilities: A multicriteria approach. Decision Sciences, 11(4):714–724, 1980.
529. G. M. Schmidt and C. T. Druehl. Changes in product attributes and costs as drivers of new product diffusion and substitution. Production and Operations Management, 14(3):272–285, 2005.
530. A. J. Schmitt, L. V. Snyder, and Z.‐J. M. Shen. Inventory systems with stochastic demand and supply: Properties and approximations. European Journal of Operational Research, 206(2):313–328, 2010.
531. A. J. Schmitt, S. A. Sun, L. V. Snyder, and Z.‐J. M. Shen. Centralization versus decentralization: Risk pooling, risk diversification, and supply uncertainty in a one‐warehouse multiple‐retailer system. OMEGA, 52:201–212, 2015.
532. L. Schrage. Implicit representation of variable upper bounds in linear programming. Mathematical Programming Studies, 4:118–132, 1978.
533. A. J. Scott. Dynamic location‐allocation systems: Some basic planning strategies. Environment and Planning A, 3(1):73–82, 1971.
534. R. Serfozo and S. Stidham. Semi‐stationary clearing processes. Stochastic Processes and Their Applications, 6(2):165–178, 1978.
535. D. Serra and V. Marianov. The p‐median problem in a changing network: The case of Barcelona. Location Science, 6:383–394, 1998.
536. D. Serra and C. ReVelle. Market capture by two competitors: The preemptive location problem. Journal of Regional Science, 34(4):549–561, 1994.
537. D. Serra, S. Ratick, and C. ReVelle. The maximum capture problem with uncertainty. Environment and Planning B, 23:49–59, 1996.
538. M. I. Shamos. Geometric complexity. In Proceedings of Seventh Annual ACM Symposium on Theory of Computing, pages 224–233, New York, 1975. ACM.
539. M. I. Shamos and D. Hoey. Closest‐point problems. In Proceedings of the 16th Annual Symposium on Foundations of Computer Science, pages 151–162, 1975.
540. K. H. Shang and J.‐S. Song. Newsvendor bounds and heuristic for optimal policies in serial supply chains. Management Science, 49(5):618–638, 2003.
541. Z.‐J. M. Shen. Integrated supply chain design models: A survey and future research directions. Journal of Industrial and Management Optimization, 3 (1):1–27, 2007.
542. Z.‐J. M. Shen, C. R. Coullard, and M. S. Daskin. A joint location‐inventory model. Transportation Science, 37(1):40–55, 2003.
543. Z.‐J. M. Shen, R. L. Zhan, and J. Zhang. The reliable facility location problem: Formulations, heuristics, and approximation algorithms. INFORMS Journal on Computing, 23(3):470–482, 2011.
544. C. C. Sherbrooke. METRIC: A multi‐echelon technique for recoverable item control. Operations Research, 16(1):122–141, 1968.
545. C. C. Sherbrooke. Waiting time in an inventory system: Constant service time case. Operations Research, 23(4): 819–820, 1975.
546. D. R. Shier. A min‐max theorem for p‐center problems on a tree. Transportation Science, 11(3):243–252, 1977.
547. D. R. Shier and P. M. Dearing. Optimal locations for a class of nonlinear, single‐facility location problems on a network. Operations Research, 31(2): 292–303, 1983.
548. D. B. Shmoys and D. P. Williamson. Analyzing the Held‐Karp TSP bound: A monotonicity property with application. Information Processing Letters, 35: 281–285, 1990.
549. J. Shu, C.‐P. Teo, and Z.‐J. M. Shen. Stochastic transportation‐inventory network design problem. Operations Research, 53(1):48–60, 2005.
550. E. A. Silver and D. P. Bischak. The exact fill rate in a periodic review base stock system under normally distributed demand. OMEGA, 39(3):346–349, 2011.
551. E. A. Silver, D. F. Pyke, and R. Peterson. Inventory Management and Production Planning and Scheduling. John Wiley & Sons, New York, 3rd edition, 1998.
552. D. Simchi‐Levi and Y. Wei. Understanding the performance of the long chain and sparse designs in process flexibility. Operations Research, 60(5):1125–1141, 2012.
553. D. Simchi‐Levi, X. Chen, and J. Bramel. The Logic of Logistics. Springer, New York, 3rd edition, 2013.
554. D. Simchi‐Levi, W. Schmidt, Y. Wei, P. Y. Zhang, K. Combs, Y. Ge, O. Gusikhin, M. Sanders, and D. Zhang. Identifying risks and mitigating disruptions in the automotive supply chain. Interfaces, 45(5):375–390, 2015.
555. K. F. Simpson, Jr. In‐process inventories. Operations Research, 6(6):863–873, 1958.
556. L. V. Snyder. Facility location under uncertainty: A review. IIE Transactions, 38(7):537–554, 2006.
557. L. V. Snyder. Covering problems. In H. A. Eiselt and V. Marianov, editors, Foundations of Location Analysis, chapter 6, pages 109–135. Springer‐Verlag, Berlin, 2011.
558. L. V. Snyder. A tight approximation for a continuous‐review inventory model with supplier disruptions. International Journal of Production Economics, 155:91–108, 2014.
559. L. V. Snyder. Inventory and supply chain optimization. In T. Terlaky, M. Anjos, and S. Ahmed, editors, Advances and Trends in Optimization with Engineering Applications, chapter 33, pages 439–455. SIAM, Philadelphia, 2017.
560. L. V. Snyder and M. S. Daskin. Reliability models for facility location: The expected failure cost case. Transportation Science, 39(3):400–416, 2005.
561. L. V. Snyder and M. S. Daskin. Models for reliable supply chain network design. In A. T. Murray and T. H. Grubesic, editors, Critical Infrastructure: Reliability and Vulnerability, chapter 13, pages 257–289. Springer‐Verlag, New York, 2007.
562. L. V. Snyder and Z.‐J. M. Shen. Supply and demand uncertainty in multi‐echelon supply chains. Technical report, Lehigh University, Bethlehem, PA, 2006.
563. L. V. Snyder and B. T. Tomlin. On the value of a threat advisory system for managing supply chain disruptions. Technical report, Lehigh University, Bethlehem, PA, 2007.
564. L. V. Snyder, M. P. Scaparra, M. S. Daskin, and R. L. Church. Planning for disruptions in supply chain networks. In M. P. Johnson, B. Norman, and N. Secomandi, editors, Tutorials in Operations Research, chapter 9, pages 234–257. INFORMS, Hanover, MD, 2006.
565. L. V. Snyder, Z. Atan, P. Peng, Y. Rong, A. Schmitt, and B. Sinsoysal. OR/MS models for supply chain disruptions: A review. IIE Transactions, 48(2):89–109, 2016.
566. M. M. Solomon. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2):254–265, 1987.
567. J.‐S. Song and P. H. Zipkin. Inventory control with information about supply conditions. Management Science, 42(10):1409–1419, 1996.
568. J. J. Spengler. Vertical integration and antitrust policy. Journal of Political Economy, 58(4):347–352, 1950.
569. J. D. Sterman. Modeling managerial behavior: Misperceptions of feedback in a dynamic decision making experiment. Management Science, 35(3):321–339, 1989.
570. W. R. Stewart. A computationally efficient heuristic for the traveling salesman problem. In Proceedings of the 13th Annual Meetings of S.E. TIMS, pages 75–85, 1977.
571. F. Sultan, J. U. Farley, and D. R. Lehmann. A meta‐analysis of applications of diffusion models. Journal of Marketing Research, 27(1):70–77, 1990.
572. T. Sundstrom. Mathematical Reasoning: Writing and Proof. Prentice Hall, Upper Saddle River, NJ, 2nd edition, 2006.
573. R. W. Swain. A parametric decomposition approach for the solution of uncapacitated location problems. Management Science, 21(2):189–198, 1974.
574. J. M. Swaminathan and S. R. Tayur. Managing broader product lines through delayed differentiation using vanilla boxes. Management Science, 44(12): S161–S172, 1998.
575. E. W. Taft. The most economical production lot. Iron Age, 101:1410–1412, 1918.
576. G. Tagaras. Effects of pooling on the optimization and service levels of two‐location inventory systems. IIE Transactions, 21:250–257, 1989.
577. G. Tagaras. Pooling in multi‐location periodic inventory distribution systems. OMEGA, 27:39–59, 1999.
578. E. Taillard. Parallel iterative search methods for vehicle routing problems. Networks, 23(8):661–673, 1993.
579. A. C. Tamhane and D. D. Dunlop. Statistics and Data Analysis: From Elementary to Intermediate. Prentice Hall, Upper Saddle River, NJ, 1999.
580. C. Tan and J. E. Beasley. A heuristic algorithm for the period vehicle routing problem. OMEGA, 12(5):497–504, 1984.
581. B. C. Tansel. Discrete center problems. In H. A. Eiselt and V. Marianov, editors, Foundations of Location Analysis, chapter 5, pages 79–106. Springer‐Verlag, Berlin, 2011.
582. B. C. Tansel, R. L. Francis, T. J. Lowe, and M. Chen. Duality and distance constraints for the nonlinear p‐center problem and covering problem on a tree network. Operations Research, 30(4):725–744, 1982.
583. M. B. Teitz and P. Bart. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16(5):955–961, 1968.
584. C.‐P. Teo and J. Shu. Warehouse‐retailer network design problem. Operations Research, 52(3):396–408, 2004.
585. C.‐P. Teo, J. Ou, and M. Goh. Impact on inventory costs with consolidation of distribution centers. IIE Transactions, 33(2):99–110, 2001.
586. R. H. Teunter. Note on the fill rate of single‐stage general periodic review inventory systems. Operations Research Letters, 37(1):67–68, 2009.
587. P. M. Thompson and H. N. Psaraftis. Cyclic transfer algorithm for multivehicle routing and scheduling problems. Operations Research, 41(5):935–946, 1993.
588. B. T. Tomlin. On the value of mitigation and contingency strategies for managing supply‐chaindisruption risks (unabridged version). Working paper, Kenan‐Flagler Business School, UNC‐Chapel Hill, April 2005.
589. B. T. Tomlin. On the value of mitigation and contingency strategies for managing supply chain disruption risks. Management Science, 52(5):639–657, 2006.
590. H. Topaloglu. A tighter variant of Jensen's lower bound for stochastic programs and separable approximations to recourse functions. European Journal of Operational Research, 199(2):315–322, 2009.
591. C. Toregas and C. ReVelle. Optimal location under time or distance constraints. Papers of the Regional Science Association, 28:133–143, 1972.
592. C. Toregas, R. Swain, C. ReVelle, and L. Bergman. The location of emergency service facilities. Operations Research, 19(6):1363–1373, 1971.
593. P. Toth and D. Vigo. An exact algorithm for the vehicle routing problem with backhauls. Transportation Science, 31:372–385, 1997.
594. P. Toth and D. Vigo. A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. European Journal of Operational Research, 113:528–543, 1999.
595. P. Toth and D. Vigo, editors. The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia, 2001a.
596. P. Toth and D. Vigo. Branch‐and‐bound algorithms for the capacitated VRP. In P. Toth and D. Vigo, editors, The Vehicle Routing Problem, chapter 2, pages 29–51. Society for Industrial and Applied Mathematics, Philadelphia, 2001b.
597. P. Toth and D. Vigo. VRP with backhauls. In P. Toth and D. Vigo, editors, The Vehicle Routing Problem, chapter 8, pages 195–224. Society for Industrial and Applied Mathematics, Philadelphia, 2001c.
598. P. Toth and D. Vigo. The granular tabu search and its application to the vehicle‐routing problem. INFORMS Journal on Computing, 15(4):333–346, 2003.
599. Toyota Motor Corporation. Annual report 2012, 2012. URL https://www.toyota‐global.com/pages/contents/investors/ir_library/annual/pdf/2012/ar12_e.pdf.
600. K. Train. A validation test of a disaggregate mode choice model. Transportation Research, 12:167–174, 1978.
601. K. Train, D. McFadden, and M. Ben‐Akiva. The demand for local telephone service: A fully discrete model of residential calling patterns and service choices. RAND Journal of Economics, 18(1):109–123, 1987.
602. K. E. Train. Discrete Choice Methods with Simulation. Cambridge University Press, New York, NY, 2nd edition, 2009.
603. A. A. Tsay. The quantity flexibility contract and supplier‐customer incentives. Management Science, 45:1339–1358, 1999.
604. G. L. Vairaktarakis and P. Kouvelis. Incorporation dynamic aspects and uncertainty in 1‐median location problems. Naval Research Logistics, 46(2): 147–168, 1999.
605. A. J. Vakharia and A. Yenipazarli. Managing supply chain disruptions. Foundations and Trends in Technology, Information and Operations Management, 2(4):243–325, 2008.
606. J. Van Biesebroeck. Complementarities in automobile production. Journal of Applied Econometrics, 22(7):1315–1345, 2007.
607. A. Van Breedam. An analysis of the effect of local improvement operators in genetic algorithms and simulated annealing for the vehicle routing problem. RUCA working paper 96/14, University of Antwerp, Belgium, 1996.
608. G. J. van Houtum, K. Inderfurth, and W. Zijm. Materials coordination in stochastic multi‐echelon systems. European Journal of Operational Research, 95:1–23, 1996.
609. T. J. Van Roy. A cross decomposition algorithm for capacitated facility location. Operations Research, 34(1):145–163, 1986.
610. T. J. Van Roy and D. Erlenkotter. A dual‐based procedure for dynamic facility location. Management Science, 28(10):1091–1105, 1982.
611. A. F. Veinott, Jr. Optimal policy for a multi‐product, dynamic, nonstationary inventory problem. Management Science, 12(3):206–222, 1965.
612. A. F. Veinott, Jr. On the optimality of inventory policies: New conditions and a new proof. SIAM Journal on Applied Mathematics, 14(5):1067–1083, 1966.
613. A. F. Veinott, Jr. and H. M. Wagner. Computing optimal inventory policies. Management Science, 11(5):525–552, 1965.
614. D. J. Velleman. How to Prove It: A Structured Approach. Cambridge University Press, New York, NY, 2nd edition, 2006.
615. K. Venkatesh, V. Ravi, A. Prinzie, and D. Van den Poel. Cash demand forecasting in ATMs by clustering and neural networks. European Journal of Operational Research, 232(2):383–392, 2014.
616. M. Ventosa, Á. Baíllo, A. Ramos, and M. Rivier. Electricity market modeling trends. Energy Policy, 33(7):897–913, 2005.
617. T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins. Heuristics for multi‐attribute vehicle routing problems: A survey and synthesis. European Journal of Operational Research, 231(1):1–21, 2013.
618. P. VonAchen, K. Smilowitz, M. Raghavan, and R. Feehan. Optimizing community healthcare coverage in remote Liberia. Journal of Humanitarian Logistics and Supply Chain Management, 6(3):352–371, 2016.
619. A. Wagelmans, S. V. Hoesel, and A. Kolen. Economic lot sizing: An algorithm that runs in linear time in the Wagner‐Whitin case. Operations Research, 40(S1):S145–S156, 1992.
620. H. M. Wagner and T. M. Whitin. Dynamic version of the economic lot size model. Management Science, 5(1):89–96, 1958.
621. A. Warburton. Worst‐case analysis of some convex hull heuristics for the Euclidean travelling salesman problem. Operations Research Letters, 13(1): 37–42, 1993.
622. P. Wark and J. Holt. A repeated matching heuristic for the vehicle routeing problem. Journal of the Operational Research Society, 45(10):1156–1167, 1994.
623. J. R. Weaver and R. L. Church. Computational procedures for location problems on stochastic networks. Transportation Science, 17(2):168–180, 1983.
624. G. O. Wesolowsky. Dynamic facility location. Management Science, 19(11): 1241–1248, 1973.
625. R. A. Whitaker. A fast algorithm for the greedy interchange of large‐scale clustering and median location problems. INFOR, 21(2):95–108, 1983.
626. T. M. Whitin. The Theory of Inventory Management. Princeton University Press, Princeton, NJ, 1953.
627. W. E. Wilhelm. A technical review of column generation in integer programming. Optimization and Engineering, 2(2):159–200, 2001.
628. P. R. Winters. Forecasting sales by exponentially weighted moving averages. Management Science, 6(3):324–342, 1960.
629. L. A. Wolsey. Heuristic analysis, linear programming and branch and bound. Mathematical Programming Study, 13:121–134, 1980.
630. R. T. Wong. A dual ascent approach for Steiner tree problems on a directed graph. Mathematical Programming, 28(3):271–287, 1984.
631. World Health Organization. Influenza (seasonal): Fact sheet, January 2018. URL http://www.who.int/mediacentre/factsheets/fs211/en.
632. A. Wren. Computers in Tranport Planning and Operation. Ian Allan, London, 1971.
633. A. Wren and A. Holliday. Computer scheduling of vehicles from one or more depots to a number of delivery points. Journal of the Operational Research Society, 23:333–344, 1972.
634. P. D. Wright, M. J. Liberatore, and R. L. Nydick. A survey of operations research models and applications in homeland security. Interfaces, 36(6):514–529, 2006.
635. O. Q. Wu and Y. Ouyang. Supply chain design and optimization with applications in the energy industry. In T. Terlaky, M. Anjos, and S. Ahmed, editors, Advances and Trends in Optimization with Engineering Applications, chapter 34, pages 457–468. SIAM, Philadelphia, 2017.
636. S. D. Wu, B. Aytac, R. Berger, and C. Armbruster. Managing short life‐cycle technology products for Agere systems. Interfaces, 36(3):234–247, 2006.
637. S. D. Wu, K. G. Kempf, M. O. Atan, B. Aytac, S. A. Shirodkar, and A. Mishra. Improving new‐product forecasting at Intel Corporation. Interfaces, 40(5): 385–396, 2010.
638. J. Xu and J. P. Kelly. A network flow‐based tabu search heuristic for the vehicle routing problem. Transportation Science, 30(4):379–393, 1996.
639. P. Yadav, D. M. Miller, C. P. Schmidt, and R. Drake. McGriff Treading Company implements service contracts with shared savings. Interfaces, 33(6):18–29, 2003.
640. C. A. Yano and H. L. Lee. Lot sizing with random yield: A review. Operations Research, 43(2):311–334, 1995.
641. P. Yellow. A computational modification to the savings method of vehicle scheduling. Operational Research Quarterly, 21:281–283, 1970.
642. H. Younies and H. A. Eiselt. Sequential location models. In H. A. Eiselt and V. Marianov, editors, Foundations of Location Analysis, chapter 8, pages 163–178. Springer‐Verlag, Berlin, 2011.
643. W. I. Zangwill. A deterministic multi‐period production scheduling model with backlogging. Management Science, 13(1):105–119, 1966.
644. J. Zhang and J. Zhang. Fill rate of single‐stage general periodic review inventory systems. Operations Research Letters, 35(4):503–509, 2007.
645. X. Zhang. The impact of forecasting methods on the bullwhip effect. International Journal of Production Economics, 88:15–27, 2004.
646. H. Zhao. Supply chain optimization in healthcare. In T. Terlaky, M. Anjos, and S. Ahmed, editors, Advances and Trends in Optimization with Engineering Applications, chapter 35, pages 469–478. SIAM, Philadelphia, 2017.
647. Y. Zheng. A simple proof for the optimality of policies for infinite‐horizon inventory problems. Journal of Applied Probability, 28:802–810, 1991.
648. Y.‐S. Zheng. On properties of stochastic inventory systems. Management Science, 38(1):87–103, 1992.
649. Y.‐S. Zheng and A. Federgruen. Finding optimal policies is about as simple as evaluating a single policy. Operations Research, 39(4):654–665, 1991.
650. Y.‐S. Zheng and A. Federgruen. Errata: Finding optimal policies is about as simple as evaluating a single policy. Operations Research, 40(1):192, 1992.
651. D. Zhou, L. C. Leung, and W. P. Pierskalla. Inventory management of platelets in hospitals: Optimal inventory policy for perishable products with regular and optional expedited replenishments. Manufacturing & Service Operations Management, 13(4):420–438, 2011.
652. Y. Zhou, A. Scheller‐Wolf, N. Secomandi, and S. Smith. Managing wind‐based electricity generation in the presence of storage and transmission capacity. Working paper, Tepper School of Business, Carnegie Mellon University, Pittsburgh, 2018.
653. P. Ziobro. As web sales spike, retailers scramble to ship from stores. Wall Street Journal, December 1, 2016.
654. P. H. Zipkin. Inventory service‐level measures: Convexity and approximation. Management Science, 32(8):975–981, 1986a.
655. P. H. Zipkin. Stochastic leadtimes in continuous‐time inventory models. Naval Research Logistics Quarterly, 33(4):763–774, 1986b.
656. P. H. Zipkin. Foundations of Inventory Management. Irwin/McGraw‐Hill, New York, 2000.
657. P. H. Zipkin. Old and new methods for lost‐sales inventory systems. Operations Research, 56(5):1256–1263, 2008a.
658. P. H. Zipkin. On the structure of lost‐sales inventory models. Operations Research, 56(4):937–944, 2008b.