The periodic joint replenishment problem is strongly NP-hard

Tamar Cohen-Hillel, Liron Yedidsion

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

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 NP-hard.

Original languageEnglish
Pages (from-to)1269-1289
Number of pages21
JournalMathematics of Operations Research
Volume43
Issue number4
DOIs
StatePublished - 1 Jan 2018
Externally publishedYes

Keywords

  • Computational complexity
  • Joint replenishment problem
  • Supply chain management
  • Twin primes

Fingerprint

Dive into the research topics of 'The periodic joint replenishment problem is strongly NP-hard'. Together they form a unique fingerprint.

Cite this