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

Alexandr Kovalev C. T. Ng

Published in: Eur. J. Oper. Res. (2008)

Keyphrases

special case
np complete
lower bound
infinite horizon
discrete version
real world
np hard
translation invariant
discrete space
discrete geometry
data mining
case study
bayesian networks
continuous variables
continuous domains