{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T12:09:49Z","timestamp":1680437389800},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Zeitschrift f\u00fcr Operations Research"],"published-print":{"date-parts":[[1984,10]]},"DOI":"10.1007\/bf01920916","type":"journal-article","created":{"date-parts":[[2005,7,22]],"date-time":"2005-07-22T16:34:54Z","timestamp":1122050094000},"page":"143-152","source":"Crossref","is-referenced-by-count":2,"title":["A value-iteration scheme for undiscounted multichain Markov renewal programs"],"prefix":"10.1007","volume":"28","author":[{"given":"P. J.","family":"Schweitzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01920916_CR1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.2307\/1426039","volume":"5","author":"J. Bather","year":"1973","unstructured":"Bather, J.: Optimal Decision Procedures for Finite Markov Chains. Adv. in Appl. Prob.5 (1973) PartsI, II, III, 328\u2013339, 521\u2013540, 541\u2013553.","journal-title":"Adv. in Appl. Prob."},{"key":"BF01920916_CR2","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/mnsc.10.4.716","volume":"10","author":"J. Cani de","year":"1964","unstructured":"de Cani, J.: A Dynamic Programming Algorithm for Embedded Markov Chains When the Planning Horizon is at Infinity. Man. Sci.10, 1964, 716\u2013733.","journal-title":"Man. Sci."},{"key":"BF01920916_CR3","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1137\/0116038","volume":"16","author":"E.V. Denardo","year":"1968","unstructured":"Denardo, E.V., andB.L. Fox: Multichain Markov Renewal Programs. SIAM J. Appl. Math.16, 1968, 468\u2013487.","journal-title":"SIAM J. Appl. Math."},{"key":"BF01920916_CR4","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1287\/mnsc.26.12.1211","volume":"26","author":"A. Federgruen","year":"1980","unstructured":"Federgruen, A., andD. Spreen: A New Specification of the Multichain Policy Iteration Algorithm in Undiscounted Markov Renewal Programs. Man. Sci.26, 1980, 1211\u20131217.","journal-title":"Man. Sci."},{"key":"BF01920916_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF00935474","volume":"34","author":"A. Federgruen","year":"1981","unstructured":"Federgruen, A., andP.J. Schweitzer: Non-Stationary Markov Decision Processes with Converging Parameters. J. Opt. Th. and Its Appl.34, 1981, 207\u2013242.","journal-title":"J. Opt. Th. and Its Appl."},{"key":"BF01920916_CR6","unstructured":"-: A Fixed Point Approach to Undiscounted Markov Renewal Programs. To appear in SIAM J. Algebraic and Discrete methods 1984."},{"key":"BF01920916_CR7","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1145\/364063.364082","volume":"11","author":"B.L. Fox","year":"1968","unstructured":"Fox, B.L., andD.M. Landi: An Algorithm for Identifying the Ergodic Subchains and Transient States of a Stochastic Matrix. Comm. ACM11, 1968, 619\u2013621.","journal-title":"Comm. ACM"},{"key":"BF01920916_CR8","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1287\/mnsc.25.4.352","volume":"25","author":"A. Hordijk","year":"1979","unstructured":"Hordijk, A., andL.C.M. Kallenberg: Linear Programming and Markov Decision Chains. Man. Sci.25, 1979, 352\u2013362.","journal-title":"Man. Sci."},{"key":"BF01920916_CR9","first-page":"163","volume":"6","author":"R.A. Howard","year":"1964","unstructured":"Howard, R.A.: Research in Semi-Markovian Decision Structures. J. Oper. Res. Soc. Japan6, 1964, 163\u2013199.","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"BF01920916_CR10","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1287\/opre.11.6.938","volume":"11","author":"W.S. Jewell","year":"1963","unstructured":"Jewell, W.S.: Markov Renewal Programming. I and II. Oper. Res.11, 1963, 938\u2013971.","journal-title":"Oper. Res."},{"key":"BF01920916_CR11","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1287\/opre.25.3.529","volume":"25","author":"L. Platzman","year":"1977","unstructured":"Platzman, L.: Improved Conditions for Convergence in Undiscounted Markov Renewal Programming. Oper. Res.25, 1977, 529\u2013533.","journal-title":"Oper. Res."},{"key":"BF01920916_CR12","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/0022-247X(71)90094-1","volume":"34","author":"P.J. Schweitzer","year":"1971","unstructured":"Schweitzer, P.J.: Iterative Solution of the Functional Equations of Undiscounted Markov Renewal Programming. J. Math. Anal. Appl.34, 1971, 495\u2013501.","journal-title":"J. Math. Anal. Appl."},{"key":"BF01920916_CR13","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1287\/moor.3.4.308","volume":"3","author":"P.J. Schweitzer","year":"1978","unstructured":"Schweitzer, P.J., andA. Federgruen: The Functional Equations of Undiscounted Markov Renewal Programming. Math. of Oper. Res.3, 1978a, 308\u2013322.","journal-title":"Math. of Oper. Res."},{"key":"BF01920916_CR14","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/0022-247X(78)90044-6","volume":"64","author":"P.J. Schweitzer","year":"1978","unstructured":"\u2014: Foolproof Convergence in Multichain Policy Iteration. J. Math. Anal. Appl.64, 1978b, 360\u2013368.","journal-title":"J. Math. Anal. Appl."},{"key":"BF01920916_CR15","doi-asserted-by":"crossref","first-page":"188","DOI":"10.2307\/1426774","volume":"11","author":"P.J. Schweitzer","year":"1979","unstructured":"\u2014: Geometric Convergence of Value-Iteration in Multichain Markov Decision Problems. Adv. in Appl. Prob.11, 1979, 188\u2013217.","journal-title":"Adv. in Appl. Prob."},{"key":"BF01920916_CR16","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1214\/aoms\/1177699272","volume":"37","author":"A.F. Veinott","year":"1966","unstructured":"Veinott, A.F.: On Finding Optimal Policies in Discrete Dynamic Programming with no Discounting. Ann. Math. Statist.37, 1966, 1284\u20131294.","journal-title":"Ann. Math. Statist."}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01920916.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01920916\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01920916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:39:12Z","timestamp":1557448752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01920916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["BF01920916"],"URL":"https:\/\/doi.org\/10.1007\/bf01920916","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}