{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:56:23Z","timestamp":1648976183596},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1975,9,1]],"date-time":"1975-09-01T00:00:00Z","timestamp":178761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Automatica"],"published-print":{"date-parts":[[1975,9]]},"DOI":"10.1016\/0005-1098(75)90025-4","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:27:27Z","timestamp":1047630447000},"page":"499-508","source":"Crossref","is-referenced-by-count":4,"title":["One-at-a-time dynamic programming over polytope"],"prefix":"10.1016","volume":"11","author":[{"given":"U.","family":"Passy","sequence":"first","affiliation":[]},{"given":"L.","family":"Silman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0005-1098(75)90025-4_BIB1","author":"Bellman","year":"1962"},{"key":"10.1016\/0005-1098(75)90025-4_BIB2","author":"Nemhauser","year":"1971"},{"key":"10.1016\/0005-1098(75)90025-4_BIB3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0005-1098(70)90096-8","article-title":"A dynamic programming successive approximation technique with convergence proofs","volume":"6","author":"Korsak","year":"1970","journal-title":"Automatica"},{"key":"10.1016\/0005-1098(75)90025-4_BIB4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/nav.3800060105","article-title":"A convex programming procedure","volume":"6","author":"D'Esopo","year":"1956","journal-title":"Nav. Res. Log. Quart"},{"key":"10.1016\/0005-1098(75)90025-4_BIB5","series-title":"Linear Equalities and Related Systems","first-page":"19","article-title":"Polyhedral convex cones","author":"Goldman","year":"1956"},{"key":"10.1016\/0005-1098(75)90025-4_BIB6","author":"Zangwill","year":"1969"},{"key":"10.1016\/0005-1098(75)90025-4_BIB7","first-page":"181","article-title":"The gradient projection method for nonlinear programming","volume":"8","author":"Rosen","year":"1966","journal-title":"J. SIAM"}],"container-title":["Automatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0005109875900254?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0005109875900254?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T18:21:22Z","timestamp":1553624482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0005109875900254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,9]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1975,9]]}},"alternative-id":["0005109875900254"],"URL":"https:\/\/doi.org\/10.1016\/0005-1098(75)90025-4","relation":{},"ISSN":["0005-1098"],"issn-type":[{"value":"0005-1098","type":"print"}],"subject":[],"published":{"date-parts":[[1975,9]]}}}