{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:18:05Z","timestamp":1773656285298,"version":"3.50.1"},"reference-count":31,"publisher":"Pleiades Publishing Ltd","issue":"9","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Autom Remote Control"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1134\/s0005117916090101","type":"journal-article","created":{"date-parts":[[2016,9,8]],"date-time":"2016-09-08T19:37:48Z","timestamp":1473363468000},"page":"1633-1648","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A new effective dynamic program for an investment optimization problem"],"prefix":"10.1134","volume":"77","author":[{"given":"E. R.","family":"Gafarov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Dolgui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. A.","family":"Lazarev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"key":"509_CR1","volume-title":"J. Operat. Res.","author":"X.M. Li","year":"2004","unstructured":"Li, X.M., Fang, S.-C., Tian, Y., and Guo, X.L., Expanded Model of the Project Portfolio Selection Problem with Divisibility, Time Profile Factors and Cardinality Constraints, J. Operat. Res., 2004, doi:10.1057\/jors.2014.75."},{"key":"509_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84996-017-5","volume-title":"Supply Chain Engineering: Useful Methods and Techniques","author":"A. Dolgui","year":"2010","unstructured":"Dolgui, A. and Proth, J-M., Supply Chain Engineering: Useful Methods and Techniques, Berlin: Springer-Verlag, 2010."},{"issue":"1","key":"509_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10479-013-1387-3","volume":"206","author":"M. Tavana","year":"2013","unstructured":"Tavana, M., Khalili-Danghani, K., and Abtahi, A.R., A Fuzzy Multidimensional Multiple-Choice Model for Project Portfolio Selection Using an Evolutionary Algorithm, Ann. Operat. Res., 2013, vol. 206, no. 1, pp. 449\u2013483.","journal-title":"Ann. Operat. Res."},{"key":"509_CR4","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.cor.2010.10.021","volume":"30","author":"P.-T. Chang","year":"2012","unstructured":"Chang, P.-T. and Lee, J.-H., A Fuzzy DEA and Knapsack Formulation Integrated Model for Project Selection, Comput. Operat. Res., 2012, vol. 30, pp. 112\u2013125.","journal-title":"Comput. Operat. Res."},{"key":"509_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1002\/1520-6750(200102)48:1<18::AID-NAV2>3.0.CO;2-7","volume":"48","author":"G.J. Beaujon","year":"2001","unstructured":"Beaujon, G.J., Marin, S.P., and McDonald, G.C., Balancing and Optimizing a Portfolio of R&D Projects, Nav. Res. Logist., 2001, vol. 48, pp. 18\u201340.","journal-title":"Nav. Res. Logist."},{"issue":"1","key":"509_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2007.03.010","volume":"187","author":"G. Mavrotas","year":"2008","unstructured":"Mavrotas, G., Diakoulaki, D., and Kourentzis, A., Selection Among Ranked Projects under Segmentation, Policy and Logical Constraints, Eur. J. Operat. Res., 2008, vol. 187, no. 1, pp. 177\u2013192.","journal-title":"Eur. J. Operat. Res."},{"key":"509_CR7","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1002\/nav.20259","volume":"54","author":"J. Herbots","year":"2007","unstructured":"Herbots, J., Herroelen, W., and Leus, R., Dynamic Order Acceptance and Capacity Planning on a Single Bottleneck Resource, Nav. Res. Logist., 2007, vol. 54, pp. 874\u2013889.","journal-title":"Nav. Res. Logist."},{"key":"509_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/B:JOCO.0000021934.29833.6b","volume":"8","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H. and Pferschy, U., Improved Dynamic Programming in Connection with a FPTAS for the Knapsack Problem, J. Combinat. Optimiz., 2004, no. 8, pp 5\u201311.","journal-title":"J. Combinat. Optimiz."},{"issue":"2","key":"509_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0377-2217(99)00261-1","volume":"123","author":"A. Caprara","year":"2000","unstructured":"Caprara, A., Kellerer, H., Pferschy, U., and Pisinger, D., Approximation Algorithms for Knapsack Problems with Cardinality Constraints, Eur. J. Operat. Res., 2000, vol. 123, no. 2, pp. 333\u2013345.","journal-title":"Eur. J. Operat. Res."},{"issue":"4","key":"509_CR10","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1016\/j.dam.2005.08.004","volume":"154","author":"M. Mastrolilli","year":"2006","unstructured":"Mastrolilli, M. and Hutter, M., Hybrid Rounding Techniques for Knapsack Problems, Discr. Appl. Math., 2006, vol. 154, no. 4, pp. 640\u2013649.","journal-title":"Discr. Appl. Math."},{"issue":"1","key":"509_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ejor.2008.07.047","volume":"198","author":"C. Bazgan","year":"2009","unstructured":"Bazgan, C., Hugot, H., and Vanderpoorten, D., Implementing an Effcient FPTAS for the 0-1 Multi-Objective Knapsack Problem, Eur. J. Operat. Res., 2009, vol. 198, no. 1, pp. 47\u201356.","journal-title":"Eur. J. Operat. Res."},{"issue":"2","key":"509_CR12","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.ejor.2013.12.035","volume":"236","author":"V. Sristava","year":"2014","unstructured":"Sristava, V. and Bullo, F., Knapsack Problems with Sigmoid Utilities: Approximation Algorithms via Hybrid Optimization, Eur. J. Operat. Res., 2014, vol. 236, no. 2, pp. 488\u2013498.","journal-title":"Eur. J. Operat. Res."},{"issue":"4","key":"509_CR13","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1080\/02331934.2011.617818","volume":"61","author":"A. Guler","year":"2012","unstructured":"Guler, A., Nuriyev, U.G., Berberler, M.E., and Nurieva, F., Algorithms with Guarantee Value for Knapsack Problems, Optimization, 2012, vol. 61, no. 4, pp. 477\u2013488.","journal-title":"Optimization"},{"issue":"7","key":"509_CR14","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1080\/02331930902945033","volume":"58","author":"D. Fortin","year":"2009","unstructured":"Fortin, D. and Tseveendory, I., Piecewise Convex Maximization Approach to Multiknapsack, Optimization, 2009, vol. 58, no. 7, pp. 883\u2013895.","journal-title":"Optimization"},{"key":"509_CR15","first-page":"936","volume-title":"IEEE Power Engineering Society General Meeting","author":"F.L. Wu","year":"2004","unstructured":"Wu, F.L., Yen, Z., Hou, Y.H. and Ni, Y.X., Applications of AITechniques to Generation Planning and Investment, IEEE Power Engineering Society General Meeting, Denver, 2004, 936\u2013940."},{"key":"509_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., and Pisinger, D., Knapsack Problems, Berlin: Springer-Verlag, 2004."},{"key":"509_CR17","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.disopt.2006.11.002","volume":"4","author":"L.A. McLay","year":"2007","unstructured":"McLay, L.A. and Jacobson, S.H., Algorithms for the Bounded Set-up Knapsack Problem, Discr. Optimiz., 2007, vol. 4, pp. 206\u2013412.","journal-title":"Discr. Optimiz."},{"issue":"6","key":"509_CR18","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1287\/mnsc.44.6.831","volume":"44","author":"D.X. Shaw","year":"1998","unstructured":"Shaw, D.X. and Wagelmans, A.P.M., An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs, Manage. Sci., 1998, vol. 44, no. 6, pp. 831\u2013838.","journal-title":"Manage. Sci."},{"key":"509_CR19","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.ejor.2007.08.044","volume":"192","author":"S. Kameshwaran","year":"2009","unstructured":"Kameshwaran, S. and Narahari, Y., Nonconvex Piecewise Linear Knapsack Problems, Eur. J. Operat. Res., 2009, vol. 192, pp. 56\u201368.","journal-title":"Eur. J. Operat. Res."},{"issue":"4","key":"509_CR20","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10852-013-9248-2","volume":"13","author":"E.R. Gafarov","year":"2014","unstructured":"Gafarov, E.R., Dolgui, A., Lazarev, A.A., and Werner, F., A Graphical Approach to Solve an Investment Optimization Problem, J. Math. Model Algor., 2014, vol. 13, no. 4, pp. 597\u2013614.","journal-title":"J. Math. Model Algor."},{"issue":"12","key":"509_CR21","first-page":"2189","volume":"46","author":"M.A. Posypkin","year":"2006","unstructured":"Posypkin, M.A. and Sigal, I.Kh., Speedup Estimates for Some Variants of the Parallel Implementations of the Branch-and-Bound Method, J. Math. Math. Physics, 2006, vol. 46, no. 12, pp. 2189\u20132202.","journal-title":"J. Math. Math. Physics"},{"key":"509_CR22","volume-title":"A Simple 2O(x) Algorithm for PARTITION and SUBSET SUM","author":"E.T. O\u2019Neil","year":"2010","unstructured":"O\u2019Neil, E.T. and Kerlin, S., A Simple 2O(x) Algorithm for PARTITION and SUBSET SUM, 2010, http:\/\/www.lidi.info.unlp.edu.ar\/WorldComp2011-Mirror\/FCS8171.pdf."},{"issue":"3","key":"509_CR23","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00224-009-9166-x","volume":"45","author":"A. Bar-Noy","year":"2009","unstructured":"Bar-Noy, A., Golin, M.J., and Zhang, Y., Online Dynamic Programming Speedups, J. Theory Comput. Syst., 2009, vol. 45, no 3, pp. 429\u2013445.","journal-title":"J. Theory Comput. Syst."},{"key":"509_CR24","volume-title":"Proc. 29th Symp. Found. Comput. Sci.","author":"D. Eppstein","year":"1988","unstructured":"Eppstein, D., Galil, Z., and Giancarlo, R., Speeding up Dynamic Programming, Proc. 29th Symp. Found. Comput. Sci., 1988."},{"key":"509_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0167-6377(00)00040-7","volume":"27","author":"A.P.M. Wagelmans","year":"2000","unstructured":"Wagelmans, A.P.M. and Gerodimos, A.E., Improved Dynamic Programs for Some Batching Problems Involving the Maximum Lateness Criterion, Oper. Res. Lett., 2000, vol. 27, pp. 109\u2013118.","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"509_CR26","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.camwa.2009.06.008","volume":"58","author":"A.A. Lazarev","year":"2009","unstructured":"Lazarev, A.A. and Werner, F., A Graphical Realization of the Dynamic ProgrammingMethod for Solving NP-hard Problems, Comput. Math. Appl., 2009, vol. 58, no. 4, pp. 619\u2013631.","journal-title":"Comput. Math. Appl."},{"key":"509_CR27","volume-title":"Data Structures and Algorithms","author":"A.V. Aho","year":"1983","unstructured":"Aho, A.V., Hopcroft, J.E., and Ullman, J.D., Data Structures and Algorithms, London: Addison-Wesley, 1983."},{"key":"509_CR28","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10107-005-0641-0","volume":"106","author":"S. Chubanov","year":"2006","unstructured":"Chubanov, S., Kovalyov, M.Y., and Pesch, E., An FPTAS for a Single-Item Capacitated Economic Lot-Sizing Problem with Monotone Cost Structure, Math. Program., 2006, vol. 106, pp. 453\u2013466.","journal-title":"Math. Program."},{"issue":"13","key":"509_CR29","doi-asserted-by":"publisher","first-page":"3762","DOI":"10.1080\/00207543.2014.922708","volume":"52","author":"E.R. Gafarov","year":"2014","unstructured":"Gafarov, E.R., Dolgui, A., and Werner, F., A Graphical Approach for Solving Single Machine Scheduling Problems Approximately, Int. J. Production Res., 2014, vol. 52(13), pp. 3762\u20133777.","journal-title":"Int. J. Production Res."},{"issue":"4","key":"509_CR30","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.cie.2013.04.002","volume":"65","author":"K. Schemeleva","year":"2013","unstructured":"Schemeleva, K., Delorme, X., Dolgui, A., et al., Lot-Sizing on a Single Imperfect Machine: ILP Models and FPTAS Extensions, Comput. Indust. Engin., 2013. vol. 65, no. 4, pp. 561\u2013569.","journal-title":"Comput. Indust. Engin."},{"key":"509_CR31","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10479-011-1055-4","volume":"196","author":"E.R. Gafarov","year":"2012","unstructured":"Gafarov, E.R., Lazarev, A.A., and Werner, F., Transforming a Pseudo-Polynomial Algorithm for the Single Machine Total Tardiness Problem into a Polynomial One, Ann. Operat. Res., 2012, vol. 196, pp. 247\u2013261.","journal-title":"Ann. Operat. Res."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117916090101.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117916090101","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117916090101.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:29:35Z","timestamp":1773613775000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117916090101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":31,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["509"],"URL":"https:\/\/doi.org\/10.1134\/s0005117916090101","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9]]},"assertion":[{"value":"23 July 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2016","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}