Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost

Ayse Akbalik, Christophe Rapine. Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost. Oper. Res. Lett., 40(5):390-397, 2012. [doi]

@article{AkbalikR12,
  title = {Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost},
  author = {Ayse Akbalik and Christophe Rapine},
  year = {2012},
  doi = {10.1016/j.orl.2012.05.003},
  url = {http://dx.doi.org/10.1016/j.orl.2012.05.003},
  researchr = {https://researchr.org/publication/AkbalikR12},
  cites = {0},
  citedby = {0},
  journal = {Oper. Res. Lett.},
  volume = {40},
  number = {5},
  pages = {390-397},
}