An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment ProblemTim Nonner, Maxim SviridenkoIPCO2013Highly Influenced3 Excerpts

Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic DemandVineet Goyal, Retsef Levi, Danny SegevOperations Research2016

The submodular joint replenishment problemMaurice Cheung, Adam N. Elmachtoub, Retsef Levi, David B. ShmoysMath. Program.20161 Excerpt

The Periodic Joint Replenishment Problem is Strongly NP-HardTamar Cohen, Liron YedidsionArXiv20151 Excerpt