Decomposition-Based Approximation Algorithms for the One-Warehouse Multi-Retailer Problem with Concave Batch Order Costs

We study the one-warehouse multi-retailer (OWMR) problem under deterministic dynamic demand and concave batch order costs, where order batches have an identical capacity and the order cost function for each facility is concave within the batch. Under appropriate assumptions on holding cost structure, we obtain lower bounds via a decomposition that splits the two-echelon problem … Read more