A graphical realization of the dynamic programming method for solving <mml:math altimg="si18.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:math>-hard combinatorial problems, Computers & Mathematics with Applications, vol.58, issue.4, pp.619-631, 2009. ,
DOI : 10.1016/j.camwa.2009.06.008
Data Structures and Algorithms, 1983. ,
An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs, Management Science, vol.44, issue.6, pp.831-838, 1998. ,
DOI : 10.1287/mnsc.44.6.831
Nonconvex piecewise linear knapsack problems, European Journal of Operational Research, vol.192, issue.1, pp.56-68, 2009. ,
DOI : 10.1016/j.ejor.2007.08.044
URL : http://eprints.exchange.isb.edu/170/
Dynamic Programming Approach to Design FPTAS for Single Machine Scheduling Problems, 2012. ,
URL : https://hal.archives-ouvertes.fr/emse-00694362
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure, Mathematical Programming, vol.12, issue.3, pp.453-466, 2006. ,
DOI : 10.1007/s10107-005-0641-0
Kovalev: Lot-Sizing on a Single Machine, ILP Models, 2012. ,
An Improved Graphical Approach for an Investment Optimization Problem: Algorithm and a Numerical Example, p.20, 2013. ,