Answers are grounded in this paper and cite their sources.
In this paper, we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention over the years, and many heuristic and approximation algorithms have been suggested. However, in spite of the vast effort, the complexity of the problem remains unresolved. In this paper, we provide a proof that the problem is indeed strongly π©π«-hard.
No takes yet. Share an insight, caveat, or question.
Cohen-Hillel et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: