{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T07:13:24Z","timestamp":1773299604613,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1974,2,1]],"date-time":"1974-02-01T00:00:00Z","timestamp":128908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":14411,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1974,2]]},"DOI":"10.1016\/s0022-0000(74)80024-3","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T04:46:40Z","timestamp":1289364400000},"page":"84-116","source":"Crossref","is-referenced-by-count":8,"title":["Classes of discrete optimization problems and their decision problems"],"prefix":"10.1016","volume":"8","author":[{"given":"Toshihide","family":"Ibaraki","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80024-3_bib1","author":"Bellman","year":"1957"},{"key":"10.1016\/S0022-0000(74)80024-3_bib2","author":"Bellman","year":"1962"},{"key":"10.1016\/S0022-0000(74)80024-3_bib3","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/321607.321616","article-title":"Necessary and sufficient conditions for dynamic programming of combinatorial type","volume":"17","author":"Bonzon","year":"1970","journal-title":"J. Assoc. Comput. Math."},{"key":"10.1016\/S0022-0000(74)80024-3_bib4","author":"Davis","year":"1958"},{"key":"10.1016\/S0022-0000(74)80024-3_bib5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1137\/1009030","article-title":"Contraction mapping in the theory underlying dynamic programming","volume":"9","author":"Denardo","year":"1967","journal-title":"SIAM Rev."},{"key":"10.1016\/S0022-0000(74)80024-3_bib6","first-page":"106","article-title":"Elements of sequential decision processes","volume":"18","author":"Denardo","year":"1967","journal-title":"J. Ind. Eng."},{"key":"10.1016\/S0022-0000(74)80024-3_bib7","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/0022-247X(70)90066-1","article-title":"The concept of \u201cState\u201d in discrete dynamic programming","volume":"29","author":"Elmaghraby","year":"1970","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0022-0000(74)80024-3_bib8","author":"Harrison","year":"1965"},{"key":"10.1016\/S0022-0000(74)80024-3_bib9","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0022-0000(74)80024-3_bib10","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0019-9958(72)90125-8","article-title":"Representation theorems for equivalent optimization problems","volume":"21","author":"Ibaraki","year":"1973","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(74)80024-3_bib11","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/0022-247X(73)90283-7","article-title":"Solvable classes of discrete dynamic programming","volume":"43","author":"Ibaraki","year":"1973","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0022-0000(74)80024-3_bib12","article-title":"Minimal representations of some classes of dynamic programming","author":"Ibaraki","year":"1972"},{"key":"10.1016\/S0022-0000(74)80024-3_bib13","article-title":"Classes of discrete optimization problems and their decision problems","author":"Ibaraki","year":"1971"},{"key":"10.1016\/S0022-0000(74)80024-3_bib14","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1137\/0115060","article-title":"Finite-state processes and dynamic programming","volume":"15","author":"Karp","year":"1967","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0022-0000(74)80024-3_bib15","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1287\/opre.12.4.610","article-title":"Composition principles for synthesis of optimal multistage processes","volume":"12","author":"Mitten","year":"1964","journal-title":"Operations Res."},{"key":"10.1016\/S0022-0000(74)80024-3_bib16","author":"Nemhauser","year":"1966"},{"key":"10.1016\/S0022-0000(74)80024-3_bib17","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1960","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0022-0000(74)80024-3_bib18","first-page":"33","article-title":"Automata and the problem of dynamic programming","volume":"5","author":"Schreider","year":"1964","journal-title":"Problem of Cybernetics"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800243?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800243?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T18:52:22Z","timestamp":1544122342000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,2]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,2]]}},"alternative-id":["S0022000074800243"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80024-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,2]]}}}