A. Alvarez, P. Munari, and R. Morabito, Iterated local search and simulated annealing algorithms for the inventory routing problem, Int. Trans. Oper. Res, vol.25, pp.1785-1809, 2018.

H. Andersson, A. Hoff, M. Christiansen, G. Hasle, and A. Løkketangen, Industrial aspects and literature survey: Combined inventory management and routing, Comput. Oper. Res, vol.37, pp.1515-1536, 2010.

C. Archetti, N. Bianchessi, S. Irnich, and M. G. Speranza, Formulations for an inventory routing problem, Int. Trans. Oper Res, vol.21, pp.353-374, 2014.

C. Archetti, N. Boland, and M. G. Speranza, A matheuristic for the multivehicle inventory routing problem, INFORMS J. Comput, vol.29, pp.377-387, 2017.

C. Archetti, D. Feillet, M. Gendreau, and M. G. Speranza, Complexity of the VRP and SDVRP, Transp. Res. C: Emerg. Technol, vol.19, pp.741-750, 2011.

E. Arkin, D. Joneja, and R. Roundy, Computational complexity of uncapacitated multi-echelon production planning problems, Oper. Res. Lett, vol.8, pp.61-66, 1989.

F. Baita, W. Ukovich, R. Pesenti, and D. Favaretto, Dynamic routing-and-inventory problems: A review, Transp. Res. A: Policy Pract, vol.32, pp.585-598, 1998.

A. C. Baller, S. Dabia, W. E. Dullaert, and D. Vigo, The dynamic-demand joint replenishment problem with approximated transportation costs, European J. Oper. Res, vol.276, pp.1013-1033, 2019.

J. Beardwood, J. H. Halton, and J. M. Hammersley, The shortest path through many points, Math. Proc. Cambridge Philos. Soc, vol.55, pp.299-327, 1959.

L. Bertazzi, M. Savelsbergh, and M. G. Speranza, Inventory routing, The Vehicle Routing Problem: Latest Advances and New Challenges, vol.43, pp.49-72, 2008.

L. Bertazzi and M. G. Speranza, Inventory routing problems: An introduction, EURO J. Transp. Logist, vol.1, pp.307-326, 2012.

L. Bertazzi and M. G. Speranza, Inventory routing problems with multiple customers, EURO J. Transp. Logist, vol.2, pp.255-275, 2013.

T. Bosman, M. Van-ee, Y. Jiao, A. Marchetti-spaccamela, R. Ravi et al., Approximation algorithms for replenishment problems with fixed turnover times, LATIN 2018: Theoretical Informatics. LATIN 2018, vol.10807, pp.217-230, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01964685

T. W. Chien, Operational estimators for the length of a traveling salesman tour, Comput. Oper. Res, vol.19, pp.469-478, 1992.

L. C. Coelho, J. F. Cordeau, and G. Laporte, Thirty years of inventory routing, Transp. Sci, vol.48, pp.1-19, 2014.

J. F. Cordeau, G. Laporte, M. W. Savelsbergh, and D. Vigo, Vehicle routing, Handbooks in Operations Research and Management Science, vol.14, pp.367-428, 2007.

A. Das, C. Mathieu, and S. Mozes, The train delivery problem-Vehicle routing meets bin packing, Lecture Notes in Computer Science, vol.6534, pp.94-105, 2010.

W. E. De-paepe, J. K. Lenstra, J. Sgall, R. A. Sitters, and L. Stougie, Computer-aided complexity classification of dial-a-ride problems, INFORMS J. Comput, vol.16, pp.120-132, 2004.

G. Desaulniers, J. G. Rakke, and L. C. Coelho, A branch-price-and-cut algorithm for the inventory-routing problem, Transp. Sci, vol.50, pp.1060-1076, 2016.

A. Federgruen and D. Simchi-levi, Analysis of vehicle routing and inventory-routing problems, Handb. Oper. Res. Manag. Sci, vol.8, pp.297-373, 1995.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to NP-Completeness, 1979.

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy-kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Ann. Discrete Math, vol.5, pp.287-326, 1979.

V. Hemmelmayr, K. F. Doerner, R. F. Hartl, and M. W. Savelsbergh, Delivery strategies for blood products supplies, OR Spectrum, vol.31, pp.707-725, 2009.

R. Holte, A. Mok, L. Rosier, I. Tulchinsky, and D. Varvel, The pinwheel: A real-time scheduling problem, Proceedings of the 22nd Annual Hawaii International Conference on System Sciences. Volume II: Software Track, vol.2, pp.693-702, 1989.

T. Jacobs and S. Longo, A New Perspective on the Windows Scheduling Problem, 2014.

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.

N. H. Moin and S. Salhi, Inventory routing problems: A logistical overview, J. Oper. Res. Soc, vol.58, pp.1185-1194, 2007.

C. H. Papadimitriou, The Euclidean traveling salesman problem is NP-complete, Theoret. Comput. Sci, vol.4, pp.237-244, 1977.

A. M. Sarmiento, R. Nagi, A. C. Baller, M. Van-ee, M. Hoogeboom et al., A review of integrated analysis of production-distribution systems, IIE Trans, vol.31, pp.1-11, 1999.