A discrete EOQ problem is solvable in O(logn) time
- 16 September 2008
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 189 (3), 914-919
- https://doi.org/10.1016/j.ejor.2006.03.073
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Improved rounding procedures for the discrete version of the capacitated EOQ problemEuropean Journal of Operational Research, 2005
- Continuous and Discrete Shipping Strategies for the Single Link ProblemTransportation Science, 2002
- Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity ProblemAnnals of Operations Research, 2001
- Minimizing Transportation and Inventory Costs for Several Products on a Single LinkOperations Research, 1994
- Analyzing trade-offs between transportation, inventory and production costs on freight networksTransportation Research Part B: Methodological, 1985