{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T12:15:25Z","timestamp":1680437725013},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"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":[[1985,12]]},"DOI":"10.1007\/bf01918760","type":"journal-article","created":{"date-parts":[[2005,7,22]],"date-time":"2005-07-22T16:40:00Z","timestamp":1122050400000},"page":"269-284","source":"Crossref","is-referenced-by-count":1,"title":["Iterative bounds on the relative value vector in undiscounted Markov renewal programming"],"prefix":"10.1007","volume":"29","author":[{"given":"P. J.","family":"Schweitzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01918760_CR1","unstructured":"Federgruen A., andP.J. Schweitzer: A Lyapunov Function for Markov Renewal Programming. (in preparation)."},{"key":"BF01918760_CR2","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1287\/opre.19.1.240","volume":"19","author":"N.A.J. Hastings","year":"1971","unstructured":"Hastings N.A.J.: Bounds on the Gain Rate of a Markov Decision Process. Operations Research19, 1971, 240\u2013244.","journal-title":"Operations Research"},{"key":"BF01918760_CR3","first-page":"625","volume":"40","author":"R.A. Howard","year":"1963","unstructured":"Howard R.A.: Semi-Markovian Decision Processes. Bull. Inter. Stat. Inst.40, part 2, 1963, 625\u2013652.","journal-title":"Bull. Inter. Stat. Inst."},{"key":"BF01918760_CR4","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. Operations Research11, 1963, 938\u2013971.","journal-title":"Operations Research"},{"key":"BF01918760_CR5","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0022-247X(66)90060-6","volume":"14","author":"J.B. MacQueen","year":"1966","unstructured":"MacQueen J.B.: A Modified Dynamic Programming Method for Markovian Decision Problems. J. Math. Anal. Appl.14, 1966, 38\u201343.","journal-title":"J. Math. Anal. Appl."},{"key":"BF01918760_CR6","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1287\/opre.15.3.559","volume":"15","author":"J.B. MacQueen","year":"1967","unstructured":"\u2014: A Test for Suboptimal Actions in Markovian Decision Problems. Operations Research15, 1967, 559\u2013561.","journal-title":"Operations Research"},{"key":"BF01918760_CR7","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1287\/opre.17.5.857","volume":"17","author":"A. R. Odoni","year":"1969","unstructured":"Odoni A. R.: On Finding the Maximal Gain for Markov Decision Processes. Operations Research17, 1969, 857\u2013860.","journal-title":"Operations Research"},{"key":"BF01918760_CR8","first-page":"296","volume":"24","author":"K. Ohno","year":"1981","unstructured":"Ohno K.: A unified Approach to Algorithms with a Suboptimality Test in Discounted Semi-Markov Decision Processes. J. Opns. Res. Soc. Japan,24, 1981, 296\u2013324.","journal-title":"J. Opns. Res. Soc. Japan"},{"key":"BF01918760_CR9","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1287\/opre.19.3.784","volume":"19","author":"P.J. Schweitzer","year":"1971","unstructured":"Schweitzer P.J.: Multiple Policy Improvements in Undiscounted Markov Renewal Programming. Operations Research19, 1971a, 784\u2013793.","journal-title":"Operations Research"},{"key":"BF01918760_CR10","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/0022-247X(71)90094-1","volume":"34","author":"P.J. Schweitzer","year":"1971","unstructured":"\u2014: Iterative Solution of the Functional Equations of Undiscounted Markov Renewal Programming. J. Math. Anal. Appl.34, 1971b, 495\u2013501.","journal-title":"J. Math. Anal. Appl."},{"key":"BF01918760_CR11","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1287\/moor.2.4.360","volume":"2","author":"P.J. Schweitzer","year":"1977","unstructured":"Schweitzer P.J., andA. Federgruen: The Asymptotic Behavior of Undiscounted Value-Iteration in Markov Decision Problems. Math. of Operations Research2, 1977, 360\u2013381.","journal-title":"Math. of Operations Research"},{"key":"BF01918760_CR12","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1287\/moor.3.4.308","volume":"3","author":"P.J. Schweitzer","year":"1978","unstructured":"\u2014: The Functional Equations of Undiscounted Markov Renewal Programming. Math. of Operations Research3, 1978, 308\u2013322.","journal-title":"Math. of Operations Research"},{"key":"BF01918760_CR13","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. Applied Probability11, 1979, 188\u2013217.","journal-title":"Adv. Applied Probability"},{"key":"BF01918760_CR14","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0022-247X(63)90017-9","volume":"6","author":"D.J. White","year":"1963","unstructured":"White D.J.: Dynamic Programming, Markov Chains, and the Method of Successive Approximations. J. Math. Anal. Appl.6, 1963, 373\u2013376.","journal-title":"J. Math. Anal. Appl."},{"key":"BF01918760_CR15","doi-asserted-by":"crossref","unstructured":"-: Elimination of Non-optimal Actions in Markov Decision Processes. In Dynamic Programming and its Applications, ed. M. L. Puterman, Academic Press, 1978, 131\u2013160.","DOI":"10.1016\/B978-0-12-568150-6.50012-X"}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01918760.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01918760\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01918760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T09:19:19Z","timestamp":1586337559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01918760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":15,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["BF01918760"],"URL":"https:\/\/doi.org\/10.1007\/bf01918760","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}