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

Alexandr Kovalev, C. T. Ng. A discrete EOQ problem is solvable in O(logn) time. European Journal of Operational Research, 189(3):914-919, 2008. [doi]

Abstract

Abstract is missing.