An Algorithm for Determining the Best Lower Bound for the Stochastic Joint Replenishment Problem
Published Online:1 Oct 2007https://doi.org/10.1287/opre.1070.0401
Supplemental Material
opre.1070.0401-sm-ec.pdf (62 KB)
- Cited by
- 29 May 2026 | International Journal of Global Economics and Management, Vol. 10, No. 5
- 14 November 2024 | IMA Journal of Management Mathematics, Vol. 36, No. 1
- Breaking truck dominance in supply chains: Proactive freight consolidation and modal split transportInternational Journal of Production Economics, Vol. 257
- 21 November 2022 | Management System Engineering, Vol. 1, No. 1
- European Journal of Operational Research, Vol. 302, No. 3
- Breaking Truck Dominance in Supply Chains: Proactive Freight Consolidation and Modal Split TransportSSRN Electronic Journal, Vol. 19
- SSRN Electronic Journal, Vol. 10
- 28 June 2018 | International Transactions in Operational Research, Vol. 28, No. 1
- Applied Mathematics and Computation, Vol. 374
- 5 December 2016 | Operational Research, Vol. 19, No. 1
- International Journal of Information Systems and Supply Chain Management, Vol. 3, No. 2
- International Journal of Production Economics, Vol. 119, No. 1
Volume 55, Issue 5
September-October 2007
Pages ii-1000
Article Information
Supplemental Material
Metrics
Information
- Received:October 01, 2004
- Accepted:August 01, 2006
- Published Online:October 01, 2007
Copyright © 2007, INFORMS
Cite as
S. Viswanathan, (2007) An Algorithm for Determining the Best Lower Bound for the Stochastic Joint Replenishment Problem. Operations Research 55(5):992-996.
https://doi.org/10.1287/opre.1070.0401
Keywords
