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

MaRDI QIDQ5365022zbMATH OpenFDO

Authors G. Massonnet, Gautier Stauffer, Christophe Rapine, Jean-Philippe Gayon

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133042

Mathematics Subject Classification ID

Approximation algorithms (68W25) Inventory, storage, reservoirs (90B05)

Recommendations

• Fast approximation algorithms for the one-warehouse multi-retailer problem under general cost structures and capacity constraints
• Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales
• Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
• Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
• A constant approximation algorithm for the one-warehouse multi-retailer problem

Cited in

(15)

• Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results
• On reformulations for the one-warehouse multi-retailer problem
• A constant approximation algorithm for the one-warehouse multi-retailer problem
• The submodular joint replenishment problem
• A constant approximation algorithm for the one-warehouse multiretailer problem
• Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales
• Inventory models with shelf-age and delay-dependent inventory costs
• Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
• Approximation Procedures for the One-Warehouse Multi-Retailer System
• Approximation algorithms for general one-warehouse multi-retailer systems
• A continuous review model with general shelf age and delay-dependent inventory costs
• Fast approximation algorithms for the one-warehouse multi-retailer problem under general cost structures and capacity constraints
• <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs
• Integrated inventory routing and freight consolidation for perishable goods

This page was built for publication: A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365022)