A new heuristic to solve the one-warehouse N-retailer problem
From MaRDI portal
Publication:732886
DOI10.1016/J.COR.2009.04.012zbMATH Open1175.90013OpenAlexW1989968455MaRDI QIDQ732886FDOQ732886
J. Sicilia, Andreas Nilsson, Beatriz Abdul-Jalbar, Anders Segerstedt
Publication date: 15 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.012
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 (6)
- 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
- 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)