A constant approximation algorithm for the one-warehouse multi-retailer problem

MaRDI QIDQ2921691zbMATH OpenFDO

Authors Retsef Levi, Robin Roundy, David B. Shmoys

Publication date 13 October 2014

Mathematics Subject Classification ID

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

Recommendations

• 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
• A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem
• Fast approximation algorithms for the one-warehouse multi-retailer problem under general cost structures and capacity constraints
• Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem

Cited in

(10)

• Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results
• New results on multi-level aggregation
• 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
• Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
• Online Algorithms for Multilevel Aggregation
• Fast approximation algorithms for the one-warehouse multi-retailer problem under general cost structures and capacity constraints
• A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem
• Potential energy function based on the narcissus constant, its square and its cube

This page was built for publication: A constant approximation algorithm for the one-warehouse multi-retailer problem

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