The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard
Tamar Cohen-Hillel, Liron Yedidsion
Source record
Source: Crossref
Published: Nov 1, 2018
DOI: 10.1287/moor.2017.0904
Open original source ↗Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.