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

DOI10.1016/J.EJOR.2006.03.073MaRDI QIDQ2482773zbMATH OpenOpenAlexFDO

Authors 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

discrete optimizationEOQinventory management

Mathematics Subject Classification ID

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

Recommendations

• An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem
• On the discrete linear quadratic minimum-time problem
• scientific article; zbMATH DE number 4137620
• scientific article; zbMATH DE number 4020810
• An O(n log n)-algorithm for solving a special class of linear programs
• Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval
• Approximation algorithms for the discrete time-cost tradeoff problem
• Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets
• The scheme complexity of discrete optimization
• Algorithms for solving a separable problem of discrete optimization

Cites work

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

Cited in

(7)

• A new solution method for the finite-horizon discrete-time EOQ problem
• 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
• The discrete-time EOQ model: solution and implications
• Solving a finite horizon EPQ problem with backorders
• A simple solution method for the finite horizon eoq model for deteriorating items with cost changes
• Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482773)