{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:17:26Z","timestamp":1773656246476,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,2,8]],"date-time":"2014-02-08T00:00:00Z","timestamp":1391817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10852-013-9248-2","type":"journal-article","created":{"date-parts":[[2014,2,6]],"date-time":"2014-02-06T19:41:48Z","timestamp":1391715708000},"page":"597-614","source":"Crossref","is-referenced-by-count":1,"title":["A Graphical Approach to Solve an Investment Optimization Problem"],"prefix":"10.1007","volume":"13","author":[{"given":"Evgeny R.","family":"Gafarov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Dolgui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander A.","family":"Lazarev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,8]]},"reference":[{"issue":"4","key":"9248_CR1","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/j.camwa.2009.06.008","volume":"58","author":"AA Lazarev","year":"2009","unstructured":"Lazarev, A.A., Werner, F.: A graphical realization of the dynamic programming method for solving NP-hard problems. Comput. Math. Appl. 58(4), 619\u2013631 (2009)","journal-title":"Comput. Math. Appl."},{"key":"9248_CR2","unstructured":"Gafarov, E.R., Dolgui, A., Werner, F.: Dynamic programming approach to design FPTAS for single machine scheduling problems. Research Report LIMOS UMR CNRS 6158 (2012)"},{"key":"9248_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer-Verlag, Berlin (2004)"},{"issue":"6","key":"9248_CR4","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/mnsc.44.6.831","volume":"44","author":"DX Shaw","year":"1998","unstructured":"Shaw, D.X., Wagelmans, A.P.M.: An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs. Manag. Sci. 44(6), 831\u2013838 (1998)","journal-title":"Manag. Sci."},{"key":"9248_CR5","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.ejor.2007.08.044","volume":"192","author":"S Kameshwaran","year":"2009","unstructured":"Kameshwaran, S., Narahari, Y.: Nonconvex piecewise linear knapsack problems. Eur. J. Oper. Res. 192, 56\u201368 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"9248_CR6","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10107-005-0641-0","volume":"106","author":"S Chubanov","year":"2006","unstructured":"Chubanov, S., Kovalyov, M.Y., Pesch, E.: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. Math. Program. Ser. A 106, 453\u2013466 (2006)","journal-title":"Math. Program. Ser. A"},{"key":"9248_CR7","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s10589-010-9346-2","volume":"50","author":"A Dolgui","year":"2011","unstructured":"Dolgui, A., Kovalyov, M.Y., Shchamialiova, K.: Multi-product lot-sizing and sequencing on a single imperfect machine. Comput. Optim. Appl. 50, 465\u2013482 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"9248_CR8","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/j.cie.2013.04.002","volume":"65","author":"K Schmeleva","year":"2013","unstructured":"Schmeleva, K., Delorme, X., Dolgui, A., Grimaud, F., Kovalyov, M.Y.: Lot-sizing on a single machine, ILP models. Comput. Ind. Eng. 65, 561\u2013569 (2013)","journal-title":"Comput. Ind. Eng."}],"container-title":["Journal of Mathematical Modelling and Algorithms in Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-013-9248-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-013-9248-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-013-9248-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:26:33Z","timestamp":1559255193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-013-9248-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,8]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["9248"],"URL":"https:\/\/doi.org\/10.1007\/s10852-013-9248-2","relation":{},"ISSN":["2214-2487","2214-2495"],"issn-type":[{"value":"2214-2487","type":"print"},{"value":"2214-2495","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,8]]}}}