Yedidsion, Liron

1. The Periodic Joint Replenishment Problem is Strongly NP-Hard
   2015/11/08 by Tamar Cohen, Liron Yedidsion, Cohen, Tamar +1 · 1 citation
   Computer Science · Engineering · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Optimization and Packing Problems #Scheduling and Optimization Algorithms #cs.CC
2. The Continuous Joint Replenishment Problem is Strongly NP-Hard
   2020/06/07 by Alexander Tuisov, Liron Yedidsion, Tuisov, Alexander +1 · 1 citation
   Business, Management and Accounting · Engineering · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Packing Problems #Scheduling and Optimization Algorithms #Supply Chain and Inventory Management