A constant approximation algorithm for the one-warehouse multiretailer problem
From MaRDI portal
Recommendations
- A constant approximation algorithm for the one-warehouse multi-retailer problem
- A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers 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
- Fast approximation algorithms for the one-warehouse multi-retailer problem under general cost structures and capacity constraints
Cited in
(38)- Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
- Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem
- Exact analysis of the $(R, Q)$ inventory policy in a two-echelon production-inventory system
- Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system
- Joint replenishment and carbon trading in fresh food supply chains
- MIP formulations and heuristics for two-level production-transportation problems
- The one-warehouse multi-retailer problem: reformulation, classification, and computational results
- New results on multi-level aggregation
- The warehouse-inventory-transportation problem for supply chains
- A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure
- Optimal utilization of ports' free-of-charge times in one distribution center and multiple ports inventory systems
- On reformulations for the one-warehouse multi-retailer problem
- An exact analysis of a joint production-inventory problem in two-echelon inventory systems
- A constant approximation algorithm for the one-warehouse multi-retailer problem
- Modified echelon (r,Q) policies with guaranteed performance bounds for stochastic serial inventory systems
- The submodular joint replenishment problem
- The one-warehouse multiretailer problem with an order-up-to level inventory policy
- Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales
- Approximation algorithms for inventory problems with submodular or routing costs
- Inventory models with shelf-age and delay-dependent inventory costs
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
- Improved approximation algorithms for inventory problems
- Combinatorial heuristics for inventory routing problems
- Online Algorithms for Multilevel Aggregation
- Integrated Supply Chain Management via Randomized Rounding
- Single-warehouse multi-retailer inventory systems with full truckload shipments
- The periodic joint replenishment problem is strongly \(\mathcal{NP} \)-hard
- Approximation algorithms for general one-warehouse multi-retailer systems
- A continuous review model with general shelf age and delay-dependent inventory costs
- Supply chain management with online customer selection
- <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs
- Joint replenishment meets scheduling
- Approximation algorithms for supply chain planning and logistics problems with market choice
- 2-approximation algorithms for two variants of the static stochastic joint replenishment problem
- Online multi-level aggregation with delays and stochastic arrivals
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
- Uncapacitated two-level lot-sizing
This page was built for publication: A constant approximation algorithm for the one-warehouse multiretailer problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3117702)
