@article{ journals/orl/HellionMP14,
  added-at = {2014-10-13T00:00:00.000+0200},
  author = {Hellion, Bertrand and Mangione, Fabien and Penz, Bernard},
  biburl = {http://www.bibsonomy.org/bibtex/264225973e80da396f81242b9ce8a828b/dblp},
  ee = {http://dx.doi.org/10.1016/j.orl.2014.08.010},
  interhash = {15959568b7363e6c4adca3fe734ff4bc},
  intrahash = {64225973e80da396f81242b9ce8a828b},
  journal = {Oper. Res. Lett.},
  keywords = {dblp},
  number = {8},
  pages = {500-504},
  title = {A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows.},
  url = {http://dblp.uni-trier.de/db/journals/orl/orl42.html#HellionMP14},
  volume = {42},
  year = {2014}
}

{"_id":"7M2H7i7hFZagAXTSh","bibbaseid":"hellion-mangione-penz-apolynomialtimealgorithmforthesingleitemlotsizingproblemwithcapacitiesminimumorderquantitiesanddynamictimewindows-2014","downloads":0,"creationDate":"2015-05-07T12:05:12.916Z","title":"A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows.","author_short":["Hellion, B.","Mangione, F.","Penz, B."],"year":2014,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/bernard?items=1000","bibdata":{"added-at":"2014-10-13T00:00:00.000+0200","author":["Hellion, Bertrand","Mangione, Fabien","Penz, Bernard"],"author_short":["Hellion, B.","Mangione, F.","Penz, B."],"bibtex":"@article{ journals/orl/HellionMP14,\n added-at = {2014-10-13T00:00:00.000+0200},\n author = {Hellion, Bertrand and Mangione, Fabien and Penz, Bernard},\n biburl = {http://www.bibsonomy.org/bibtex/264225973e80da396f81242b9ce8a828b/dblp},\n ee = {http://dx.doi.org/10.1016/j.orl.2014.08.010},\n interhash = {15959568b7363e6c4adca3fe734ff4bc},\n intrahash = {64225973e80da396f81242b9ce8a828b},\n journal = {Oper. Res. Lett.},\n keywords = {dblp},\n number = {8},\n pages = {500-504},\n title = {A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows.},\n url = {http://dblp.uni-trier.de/db/journals/orl/orl42.html#HellionMP14},\n volume = {42},\n year = {2014}\n}","bibtype":"article","biburl":"http://www.bibsonomy.org/bibtex/264225973e80da396f81242b9ce8a828b/dblp","ee":"http://dx.doi.org/10.1016/j.orl.2014.08.010","id":"journals/orl/HellionMP14","interhash":"15959568b7363e6c4adca3fe734ff4bc","intrahash":"64225973e80da396f81242b9ce8a828b","journal":"Oper. Res. Lett.","key":"journals/orl/HellionMP14","keywords":"dblp","number":"8","pages":"500-504","title":"A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows.","type":"article","url":"http://dblp.uni-trier.de/db/journals/orl/orl42.html#HellionMP14","volume":"42","year":"2014","bibbaseid":"hellion-mangione-penz-apolynomialtimealgorithmforthesingleitemlotsizingproblemwithcapacitiesminimumorderquantitiesanddynamictimewindows-2014","role":"author","urls":{"Link":"http://dx.doi.org/10.1016/j.orl.2014.08.010","Paper":"http://dblp.uni-trier.de/db/journals/orl/orl42.html#HellionMP14"},"keyword":["dblp"],"downloads":0},"search_terms":["polynomial","time","algorithm","single","item","lot","sizing","problem","capacities","minimum","order","quantities","dynamic","time","windows","hellion","mangione","penz"],"keywords":["dblp"],"authorIDs":[],"dataSources":["wvAhRjakvxMweG8ZA"]}