Login / Signup
Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand.
Guillaume Massonnet
Jean-Philippe Gayon
Christophe Rapine
Published in:
Eur. J. Oper. Res. (2014)
Keyphrases
</>
approximation algorithms
lot sizing
randomized algorithms
vertex cover
cutting stock
np hard
lead time
multi item
multistage
mixed integer programming
special case
precedence constraints
worst case
primal dual
planning horizon
single item
optimization problems
reinforcement learning