An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem
Attributed to:
Probabilistic Rounding Algorithms for Mathematical Programming
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-36694-9_27
Publication URI: http://dx.doi.org/10.1007/978-3-642-36694-9_27
Type: Book Chapter
Book Title: Integer Programming and Combinatorial Optimization (2013)
Page Reference: 314-323
ISBN: 978-3-642-36693-2
ISSN: 2731-0469