<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>03790174</id>
  <dt>j</dt>
  <an>03790174</an>
  <augroup>
    <au>Bylka, St.</au>
  </augroup>
  <ti>Algorithm for finding horizontal plans in dynamic problems; the dynamic lot size model.</ti>
  <so>Mitt. Math. Ges. DDR 1978, No.1, 87-92 (1978).</so>
  <py>1978</py>
  <pu>Eigenverlag MGDDR, Berlin</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>dynamic lot size model</ut>
    <ut>single product</ut>
    <ut>single stocking point</ut>
    <ut>time- dependent sequences of simple dynamic programming problems</ut>
    <ut>optimal plans</ut>
    <ut>algorithms</ut>
    <ut>optimal forecast horizon</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
</item>