Rounding procedures for the discrete version of the capacitated economic order quantity problem
From MaRDI portal
Publication:1599326
DOI10.1023/A:1014986628929zbMath1015.90004OpenAlexW37808994MaRDI QIDQ1599326
Luca Bertazzi, Maria Grazia Speranza
Publication date: 9 June 2002
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014986628929
Transportation, logistics and supply chain management (90B06) Complexity and performance of numerical algorithms (65Y20)
Related Items (5)
Analysis of the best double frequency policy in the single link problem with discrete shipping times ⋮ A discrete EOQ problem is solvable in \(O(\log n)\) time ⋮ Improved rounding procedures for the discrete version of the capacitated EOQ problem ⋮ An inventory-transportation system with stochastic demand ⋮ The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications
This page was built for publication: Rounding procedures for the discrete version of the capacitated economic order quantity problem
