References
References
- 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.
- 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.
- R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows. Prentice Hall, Upper Saddle River, NJ, 1993.
- 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.
- 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.
- 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.
- 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.
- 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.
- Ö. G. Ali, S. Sayın, T. Van Woensel, and J. Fransoo. SKU demand forecasting in the presence of promotions. Expert Systems ...
Get Fundamentals of Supply Chain Theory, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.