Approximation algorithms and hardness results for the joint replenishment Problepm with constant demands Citation

@inproceedings{Demetrescu2011ApproximationAA,
  title={Approximation algorithms and hardness results for the joint replenishment Problepm with constant demands Citation},
  author={Camil Demetrescu and Magn{\'u}s M. Halld{\'o}rsson},
  year={2011}
}
In the Joint Replenishment Problem (JRP), the goal is to coordinate the replenishments of a collection of goods over time so that continuous demands are satisfied with minimum overall ordering and holding costs. We consider the case when demand rates are constant. Our main contribution is the first hardness result for any variant of JRP with constant… CONTINUE READING