The Library
An efficient polynomial-time approximation scheme for the joint replenishment problem
Tools
Nonner, Tim and Sviridenko, Maxim (2013) An efficient polynomial-time approximation scheme for the joint replenishment problem. In: Goemans, Michel and Correa, Jose, (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, Volume 7801 . Berlin Heidelberg: Springer-Verlag, pp. 314-323. ISBN 9783642366932
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1007/978-3-642-36694-9_27
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.
Item Type: | Book Item | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Series Name: | Lecture Notes in Computer Science | ||||
Publisher: | Springer-Verlag | ||||
Place of Publication: | Berlin Heidelberg | ||||
ISBN: | 9783642366932 | ||||
ISSN: | 0302-9743 | ||||
Book Title: | Integer Programming and Combinatorial Optimization | ||||
Editor: | Goemans, Michel and Correa, Jose | ||||
Official Date: | 2013 | ||||
Dates: |
|
||||
Volume: | Volume 7801 | ||||
Page Range: | pp. 314-323 | ||||
DOI: | 10.1007/978-3-642-36694-9_27 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |