A discrete EOQ problem is solvable in \(O(\log n)\) time

DOI10.1016/J.EJOR.2006.03.073zbMath1146.90317OpenAlexW1575215659MaRDI QIDQ2482773

Yanyan Li

Publication date: 24 April 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.073

zbMATH Keywords

EOQdiscrete optimizationinventory management

Mathematics Subject Classification ID

Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Related Items (4)

Solving a finite horizon EPQ problem with backorders ⋮ A new solution method for the finite-horizon discrete-time EOQ problem ⋮ The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications ⋮ A SIMPLE SOLUTION METHOD FOR THE FINITE HORIZON EOQ MODEL FOR DETERIORATING ITEMS WITH COST CHANGES

Cites Work

• Unnamed Item
• The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications
• Rounding procedures for the discrete version of the capacitated economic order quantity problem
• Improved rounding procedures for the discrete version of the capacitated EOQ problem
• Minimizing Transportation and Inventory Costs for Several Products on a Single Link
• Continuous and Discrete Shipping Strategies for the Single Link Problem
• Global optimization

This page was built for publication: A discrete EOQ problem is solvable in \(O(\log n)\) time