{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:15:10Z","timestamp":1649157310220},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"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":[[1988,3]]},"DOI":"10.1007\/bf01919182","type":"journal-article","created":{"date-parts":[[2005,7,23]],"date-time":"2005-07-23T03:28:56Z","timestamp":1122089336000},"page":"71-93","source":"Crossref","is-referenced-by-count":0,"title":["A value iteration method for undiscounted multichain Markov decision processes"],"prefix":"10.1007","volume":"32","author":[{"given":"K.","family":"Ohno","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01919182_CR1","doi-asserted-by":"crossref","first-page":"541","DOI":"10.2307\/1425833","volume":"5","author":"J Bather","year":"1973","unstructured":"Bather J (1973) Optimal decision procedures for finite Markov chains. III. Adv Appl Prob 5:541\u2013553","journal-title":"Adv Appl Prob"},{"key":"BF01919182_CR2","first-page":"284","volume-title":"Applied combinatorial mathematics","author":"L Breiman","year":"1964","unstructured":"Breiman L (1964) Stopping-rule problems. In: Beckenbach EF (ed) Applied combinatorial mathematics. Academic Press, New York, pp 284\u2013319"},{"key":"BF01919182_CR3","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1214\/aoms\/1177699999","volume":"36","author":"B Brown","year":"1965","unstructured":"Brown B (1965) On the iterative method of dynamic programming on a finite state space discrete time Markov process. Ann Math Statist 36:1279\u20131285","journal-title":"Ann Math Statist"},{"key":"BF01919182_CR4","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1137\/0116038","volume":"16","author":"EV Denardo","year":"1968","unstructured":"Denardo EV, Fox BL (1968) Multichain Markov renewal programs. SIAM J Appl Math 16:468\u2013487","journal-title":"SIAM J Appl Math"},{"key":"BF01919182_CR5","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1214\/aoms\/1177693399","volume":"42","author":"EV Denardo","year":"1971","unstructured":"Denardo EV (1971) Markov renewal programs with small interest rates. Ann Math Statist 42:477\u2013496","journal-title":"Ann Math Statist"},{"key":"BF01919182_CR6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/B978-0-12-358350-5.50005-1","volume-title":"Mathematical programming","author":"EV Denardo","year":"1973","unstructured":"Denardo EV (1973) A Markov decision problem. In: Hu TC, Robinson SM (eds) Mathematical programming. Academic Press, New York, pp 33\u201368"},{"key":"BF01919182_CR7","volume-title":"Finite state Markovian decision processes","author":"C Derman","year":"1970","unstructured":"Derman C (1970) Finite state Markovian decision processes. Academic Press, New York"},{"key":"BF01919182_CR8","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1287\/mnsc.26.12.1211","volume":"26","author":"A Federgruen","year":"1980","unstructured":"Federgruen A, Spreen D (1980) A new specification of the multichain policy iteration algorithm in undiscounted Markov renewal programs. Mgmt Sci 26:1211\u20131217","journal-title":"Mgmt Sci"},{"key":"BF01919182_CR9","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1287\/mnsc.25.4.352","volume":"25","author":"A Hordijk","year":"1979","unstructured":"Hordijk A, Kallenberg L (1979) Linear programming and Markov decision chains. Mgmt Sci 25:352\u2013362","journal-title":"Mgmt Sci"},{"key":"BF01919182_CR10","volume-title":"Dynamic programming and Markov processes","author":"R Howard","year":"1960","unstructured":"Howard R (1960) Dynamic programming and Markov processes. MIT Press, Cambridge"},{"key":"BF01919182_CR11","unstructured":"Kallenberg L (1982) Linear programming and finite Markovian control problems. Mathematical Centre Tract 148, Amsterdam"},{"key":"BF01919182_CR12","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1287\/opre.19.4.1081","volume":"19","author":"TE Morton","year":"1971","unstructured":"Morton TE (1971) Undiscounted Markov renewal programming via modified successive approximations. Opns Res 19:1081\u20131089","journal-title":"Opns Res"},{"key":"BF01919182_CR13","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1287\/opre.17.5.857","volume":"17","author":"AR Odoni","year":"1969","unstructured":"Odoni AR (1969) On finding the maximal gain for Markov decision processes. Opns Res 17:857\u2013860","journal-title":"Opns Res"},{"key":"BF01919182_CR14","unstructured":"Ohno K (1985) Modified policy iteration algorithm with non-optimality tests for undiscounted Markov decision processes. Working paper, Konan Univ."},{"key":"BF01919182_CR15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/opre.35.1.121","volume":"35","author":"K Ohno","year":"1987","unstructured":"Ohno K, Ichiki K (1987) Computing optimal policies for controlled tandem queueing systems. Opns Res 35:121\u2013126","journal-title":"Opns Res"},{"key":"BF01919182_CR16","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1287\/opre.25.3.529","volume":"25","author":"L Platzman","year":"1977","unstructured":"Platzman L (1977) Improved conditions for convergence in undiscounted Markov renewal programming. Opns Res 25:529\u2013533","journal-title":"Opns Res"},{"key":"BF01919182_CR17","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/0022-247X(71)90094-1","volume":"34","author":"PJ Schweitzer","year":"1971","unstructured":"Schweitzer PJ (1971) Iterative solution of the functional equations of undiscounted Markov renewal programming. J Math Anal Appl 34:495\u2013501","journal-title":"J Math Anal Appl"},{"key":"BF01919182_CR18","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1287\/moor.2.4.360","volume":"2","author":"PJ Schweitzer","year":"1977","unstructured":"Schweitzer PJ, Federgruen A (1977) The asymptotic behavior of undiscounted value iteration in Markov decision problem. Math Opns Res 2:360\u2013381","journal-title":"Math Opns Res"},{"key":"BF01919182_CR19","doi-asserted-by":"crossref","first-page":"188","DOI":"10.2307\/1426774","volume":"11","author":"PJ Schweitzer","year":"1979","unstructured":"Schweitzer PJ, Federgruen A (1979) Geometric convergence of value-iteration in multichain Markov decision problems. Adv Appl Prob 11:188\u2013217","journal-title":"Adv Appl Prob"},{"key":"BF01919182_CR20","first-page":"143","volume":"28","author":"PJ Schweitzer","year":"1984","unstructured":"Schweitzer PJ (1984) A value-iteration scheme for undiscounted multichain Markov renewal programs. Zeit Opns Res 28:143\u2013152","journal-title":"Zeit Opns Res"},{"key":"BF01919182_CR21","first-page":"269","volume":"29","author":"PJ Schweitzer","year":"1985","unstructured":"Schweitzer PJ (1985) Iterative bounds on the relative value vector in undiscounted Markov renewal programming. Zeit Opns Res 29:269\u2013284","journal-title":"Zeit Opns Res"},{"key":"BF01919182_CR22","first-page":"225","volume":"25","author":"D Spreen","year":"1981","unstructured":"Spreen D (1981) A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs. Zeit Opns Res 25:225\u2013233","journal-title":"Zeit Opns Res"},{"key":"BF01919182_CR23","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1214\/aoms\/1177699272","volume":"37","author":"AF Veinott","year":"1966","unstructured":"Veinott AF (1966) On finding optimal policies in discrete dynamic programming with no discounting. Ann Math Statist 37:1284\u20131294","journal-title":"Ann Math Statist"},{"key":"BF01919182_CR24","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01719500","volume":"1","author":"J Wal van der","year":"1980","unstructured":"Wal van der J (1980) The method of value oriented successive approximations for the average reward Markov decision process. OR Spektrum 1:233\u2013242","journal-title":"OR Spektrum"},{"key":"BF01919182_CR25","unstructured":"Wal van der J (1981) Stochastic dynamic programming. Mathematical Centre Tract 139, Amsterdam"},{"key":"BF01919182_CR26","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0022-247X(63)90017-9","volume":"6","author":"DJ White","year":"1963","unstructured":"White DJ (1963) Dynamic programming, Markov chain, and the method of successive approximations. J Math Anal Appl 6:373\u2013376","journal-title":"J Math Anal Appl"},{"key":"BF01919182_CR27","volume-title":"Optimization over time, vol 2","author":"P Whittle","year":"1983","unstructured":"Whittle P (1983) Optimization over time, vol 2. John Wiley, Chichester"}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01919182.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01919182\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01919182","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:32:42Z","timestamp":1557448362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01919182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["BF01919182"],"URL":"https:\/\/doi.org\/10.1007\/bf01919182","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}