Skip to content (access key 's')
Logo of Technion
Logo of CS Department

The Taub Faculty of Computer Science Events and Talks

Theory Seminar:The Periodic Joint Replenishment Problem is Strongly NP-Hard
event speaker icon
Tamar Cohen (MIT)
event date icon
Wednesday, 13.01.2016, 12:30
event location icon
Taub 201
In this research 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 were suggested. However, in spite of the vast effort, the complexity of the problem remained unresolved. In this paper, we provide a proof that the problem is indeed strongly NP-hard.

(The research was conducted in collaboration with Liron Yedidsion).