5 citations · 5 across the 3 of their papers we have counts for
3 papers
math.OC2020
The Continuous Joint Replenishment Problem is Strongly NP-Hard
Alexander Tuisov, Liron Yedidsion
The Continuous Periodic Joint Replenishment Problem (CPJRP) has been one of the core and most studied problems in supply chain management for the last half a century. Nonetheless,…
math.OC2017
Optimal Purchasing Policy For Mean-Reverting Items in a Finite Horizon
Alon Dourban, Liron Yedidsion
In this research we study a finite horizon optimal purchasing problem for items with a mean reverting price process. Under this model a fixed amount of identical items are bought u…
cs.CC2015★ 5 cited
The Periodic Joint Replenishment Problem is Strongly NP-Hard
Tamar Cohen, Liron Yedidsion
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 replenishm…