{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T11:37:16Z","timestamp":1648899436771},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T00:00:00Z","timestamp":1162512000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["cent.eur.j.oper.res."],"published-print":{"date-parts":[[2006,11,14]]},"DOI":"10.1007\/s10100-006-0010-y","type":"journal-article","created":{"date-parts":[[2006,11,2]],"date-time":"2006-11-02T07:18:30Z","timestamp":1162451910000},"page":"357-375","source":"Crossref","is-referenced-by-count":1,"title":["An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension"],"prefix":"10.1007","volume":"14","author":[{"given":"Dmitrii","family":"Lozovanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Pickl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,3]]},"reference":[{"key":"10_CR1","volume-title":"Dynamic programming and modern control theory","author":"R Bellman","year":"1965","unstructured":"Bellman R, Kalaba R (1965) Dynamic programming and modern control theory. Academic, New York and London"},{"key":"10_CR2","volume-title":"Optimal control of discrete systems","author":"VG Boltyanskii","year":"1973","unstructured":"Boltyanskii VG (1973) Optimal control of discrete systems. Nauca, Moscow"},{"issue":"1\u20133","key":"10_CR3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0166-218X(99)00144-4","volume":"99","author":"R Boliac","year":"2000","unstructured":"Boliac R, Lozovanu D, Solomon D (2000) Optimal paths in network games with p players. Discret Appl Math 99(1\u20133):339\u2013348","journal-title":"Discret Appl Math"},{"key":"10_CR4","unstructured":"Boros E, Gurvich V, (2002) On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. DIMACS Technical Report, 18, pp 1\u201332"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Feichtinger G, Hartl RF (1986) Optimale Kontrolle \u00d6konomischer Prozesse. Anwendung des in den Wirtschaftswissenschaften. de Gruyter Verlag, Berlin","DOI":"10.1515\/9783110856149"},{"key":"10_CR6","volume-title":"Analysis, controllability and optimization of time-discrete systems and dynamical games, lecture notes in economics and mathematical systems","author":"W Krabs","year":"2003","unstructured":"Krabs W, Pickl S (2003) Analysis, controllability and optimization of time-discrete systems and dynamical games, lecture notes in economics and mathematical systems. Springer, Berlin New York"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Lozovanu D, Pickl S (2004) A special dynamic programming technique for multiobjective discrete control and for dynamic games on graph-based networks, CTW Workshop on Graphs and Combinatorial Optimization, Milano, pp 184\u2013188","DOI":"10.1016\/j.endm.2004.03.041"},{"issue":"2","key":"10_CR8","first-page":"127","volume":"113","author":"D Lozovanu","year":"2005","unstructured":"Lozovanu D, Pickl S (2005) Nash equilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for k-partite networks. Central Eur J Oper Res 113(2):127\u2013146","journal-title":"Central Eur J Oper Res"},{"issue":"13","key":"10_CR9","first-page":"126","volume":"4","author":"D Lozovanu","year":"2001","unstructured":"Lozovanu D (2001) Network models of discrete optimal control problems and dynamic games with p players. Discret Math Appl 4(13):126\u2013143","journal-title":"Discret Math Appl"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/S1571-0653(04)00440-8","volume":"13","author":"D Lozovanu","year":"2003","unstructured":"Lozovanu D, Pickl S (2003) Polynomial time algorithms for determining optimal strategies. Electron Notes Discret Math 13:154\u2013158","journal-title":"Electron Notes Discret Math"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","volume":"2","author":"JF Nash","year":"1951","unstructured":"Nash JF (1951) Non cooperative games. Ann Math 2:286\u2013295","journal-title":"Ann Math"},{"key":"10_CR12","unstructured":"Weber G-W (1999\/2000) Generalized Semi-Infinite Optimization and Related Topics, habilitation thesis, Darmstadt University of Technology, Department of Mathematics"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-006-0010-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-006-0010-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-006-0010-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:24Z","timestamp":1559123364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-006-0010-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,3]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,11,14]]}},"alternative-id":["10"],"URL":"https:\/\/doi.org\/10.1007\/s10100-006-0010-y","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,3]]}}}