Login / Signup

An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem.

Tim NonnerMaxim Sviridenko
Published in: IPCO (2013)
Keyphrases
  • polynomial time approximation
  • np hard
  • approximation algorithms
  • error bounds
  • vertex cover
  • identical machines
  • bin packing
  • worst case
  • lower bound
  • mathematical model