STAUFFER, Gautier; MASSONNET, Guillaume; RAPINE, Christophe; GAYON, Jean-Philippe

Metadatos

Licencia de uso del documento

STAUFFER, Gautier
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]

MASSONNET, Guillaume
Gestion et Conduite des Systèmes de Production [G-SCOP_GCSP]

RAPINE, Christophe
Informatique et Distribution [ID-IMAG]

Idioma

Communication dans un congrès

Este ítem está publicado en

Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2011, 2011-01-23, San Francisco. 2011-01-23

SIAM

Resumen en inglés

We consider a well-known NP-hard deterministic inventory control problem: the One-Warehouse Multi-Retailer (OWMR) problem. We present a simple combinatorial algorithm to recombine the optimal solutions of the natural single-echelon inventory subproblems into a feasible solution of the OWMR problem. This approach yields a 3approximation. We then show how this algorithm can be improved to a 2-approximation by halving the demands at the warehouse and at the retailers in the subproblems. Both algorithms are purely combinatorial and can be implemented to run in linear time for traditional linear holding costs and quadratic time for more general holding cost structures. We finally show that our technique can be extended to the Joint Replenishment Problem (JRP) with backorders and to the OWMR problem with non-linear holding costs.< Leer menos

Metadatos

Compartir este ítem

Licencia de uso del documento

A simple and fast 2-approximation algorithm for the one warehouse multi-retailer problem

Idioma

Este ítem está publicado en

Resumen en inglés

URI

Orígen

Centros de investigación