Skip to main content
Conference Proceedings

An efficient polynomial-time approximation scheme for the joint replenishment problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7801 LNCS 314-323
DOI: 10.1007/978-3-642-36694-9_27
8Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give an efficient polynomial-time approximation scheme (EPTAS) for the Joint Replenishment Problem (JRP) with stationary demand. Moreover, using a similar technique, we give a PTAS for the capacitated JRP with non-stationary demand but constant size capacities. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Nonner, T., & Sviridenko, M. (2013). An efficient polynomial-time approximation scheme for the joint replenishment problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7801 LNCS, pp. 314–323). https://doi.org/10.1007/978-3-642-36694-9_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free