A new heuristic to solve the one-warehouse N-retailer problem
From MaRDI portal
(Redirected from Publication:732886)
A new heuristic to solve the one-warehouse \(N\)-retailer problem
A new heuristic to solve the one-warehouse \(N\)-retailer problem
Recommendations
- Approximation Procedures for the One-Warehouse Multi-Retailer System
- A new algorithm for one-warehouse multi-retailer systems under stationary nested policy
- The one-warehouse multi-retailer problem: reformulation, classification, and computational results
- The one-warehouse multiretailer problem with an order-up-to level inventory policy
- 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
Cites work
Cited in
(7)- A new algorithm for one-warehouse multi-retailer systems under stationary nested policy
- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
- A vendor managed inventory model under contractual storage agreement
- A numerical study on the effect of the balance assumption in one-warehouse multi-retailer inventory systems
- Efficient methods for stochastic joint replenishment and delivery problem
- The one-warehouse multi-retailer problem: reformulation, classification, and computational results
- Optimal integer-ratio inventory coordination policy for an integrated multi-stage supply chain
This page was built for publication: A new heuristic to solve the one-warehouse \(N\)-retailer problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732886)