{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:25:33Z","timestamp":1648747533254},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1980,12,1]],"date-time":"1980-12-01T00:00:00Z","timestamp":344476800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1980,12]]},"DOI":"10.1007\/bf01588291","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T16:15:32Z","timestamp":1114704932000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Optimality in transient markov chains and linear programming"],"prefix":"10.1007","volume":"18","author":[{"given":"W. R. S.","family":"Sutherland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"38","volume-title":"Mathematics of the decision sciences","author":"M.L. Balinski","year":"1968","unstructured":"M.L. Balinski, \u201cNotes on a constructive approach to linear programming\u201d, in: G.B. Dantzig and A.F. Veinott, eds.,Mathematics of the decision sciences (Am. Math. Soc., Providence, RI, 1968) pp. 38\u201364."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1214\/aoms\/1177704593","volume":"33","author":"D. Blackwell","year":"1962","unstructured":"D. Blackwell, \u201cDiscrete dynamic programming\u201d,Annals of Mathematical Statistics 33 (1962) 719\u2013726.","journal-title":"Annals of Mathematical Statistics"},{"key":"CR3","first-page":"3","volume":"14","author":"F. D'\u00c9penoux","year":"1960","unstructured":"F. D'\u00c9penoux, \u201cSur un probl\u00e8me de production et de stockage dans l'al\u00e9atoire\u201d,Revue Francaise de Recherche Op\u00e9rationelle 14 (1960) 3\u201316.","journal-title":"Revue Francaise de Recherche Op\u00e9rationelle"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1287\/mnsc.13.5.371","volume":"13","author":"G.T. DeGhellinck","year":"1967","unstructured":"G.T. DeGhellinck and C.D. Eppen, \u201cLinear programming solutions for separable Markov decision problems\u201d,Management Science 13 (1967) 371\u2013394.","journal-title":"Management Science"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1137\/1009030","volume":"9","author":"E.V. Denardo","year":"1967","unstructured":"E.V. Denardo, \u201cContraction mappings in the theory underlying dynamic programming\u201d,SIAM Review 9 (1967) 165\u2013177.","journal-title":"SIAM Review"},{"key":"CR6","volume-title":"Dynamic programming and Markov processes","author":"R.A. Howard","year":"1960","unstructured":"R.A. Howard,Dynamic programming and Markov processes (Wiley, New York, 1960)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"H.W. Kuhn, \u201cThe Hungarian method for the assignment problem\u201d,Naval Research Logistics Quarterly 2 (1955) 83\u201397.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/mnsc.6.3.259","volume":"6","author":"A.S. Manne","year":"1960","unstructured":"A.S. Manne, \u201cLinear programming and sequential decisions\u201d,Management Science 6 (1960) 259\u2013267.","journal-title":"Management Science"},{"key":"CR9","first-page":"124","volume-title":"Studies in optimization","author":"A.F. Veinott Jr.","year":"1974","unstructured":"A.F. Veinott, Jr., \u201cMarkov decision chains\u201d, in: G.B. Dantzig and B.C. Eaves, eds.,Studies in optimization (Mathematical Association of America, Washington, DC, 1974) pp. 124\u2013159."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1287\/opre.10.5.702","volume":"10","author":"P. Wolfe","year":"1962","unstructured":"P. Wolfe and G.B. Dantzig, \u201cLinear programming in a Markov chain\u201d,Operations Research 10 (1962) 702\u2013710.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588291.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01588291\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:31:50Z","timestamp":1556883110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01588291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,12]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,12]]}},"alternative-id":["BF01588291"],"URL":"https:\/\/doi.org\/10.1007\/bf01588291","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,12]]}}}