{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T09:11:38Z","timestamp":1683364298369},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1007\/bf02283617","type":"journal-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:55:02Z","timestamp":1138204502000},"page":"631-645","source":"Crossref","is-referenced-by-count":2,"title":["Replacement process decomposition for discounted Markov renewal programming"],"prefix":"10.1007","volume":"29","author":[{"given":"P. J.","family":"Schweitzer","sequence":"first","affiliation":[]},{"given":"U.","family":"Sumita","sequence":"additional","affiliation":[]},{"given":"K.","family":"Ohno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02283617_CR1","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1109\/9.24227","volume":"AC-34","author":"D.P. Bertsekas","year":"1989","unstructured":"D.P. Bertsekas and D.A. Castanon, Adaptive aggregation for infinite horizon dynamic programming, IEEE Trans. Automatic Control AC-34 (1989) 589\u2013598.","journal-title":"IEEE Trans. Automatic Control"},{"key":"BF02283617_CR2","volume-title":"Finite State Markovian Decision Processes","author":"C. Derman","year":"1970","unstructured":"C. Derman,Finite State Markovian Decision Processes (Academic Press, New York, 1970)."},{"key":"BF02283617_CR3","first-page":"73","volume-title":"Recent Developments in Markov Decision Progress","author":"A. Federgruen","year":"1980","unstructured":"A. Federgruen and P.J. Schweitzer, A survey of asymptotic value-iteration for undiscounted Markovian decision process, in:Recent Developments in Markov Decision Progress, R. Hartley, L.C. Thomas, D.J. White (eds.) (Academic Press, New York, 1980) pp. 73\u2013109."},{"issue":"2","key":"BF02283617_CR4","first-page":"625","volume":"40","author":"R.A. Howard","year":"1963","unstructured":"R.A. Howard, Semi-Markov decision processes, Bull. Int. Statist. Inst. 40 (2) (1963) 625\u2013652.","journal-title":"Bull. Int. Statist. Inst."},{"key":"BF02283617_CR5","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1287\/opre.11.6.938","volume":"11","author":"W. Jewell","year":"1963","unstructured":"W. Jewell, Markov-renewal programming I and II, Oper. Res. 11 (1963) 938\u2013972.","journal-title":"Oper. Res."},{"key":"BF02283617_CR6","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1287\/opre.23.4.687","volume":"23","author":"S. Lippman","year":"1975","unstructured":"S. Lippman, Applying a new device in the optimization of exponential systems, Oper. Res. 23 (1975) 687\u2013710.","journal-title":"Oper. Res."},{"key":"BF02283617_CR7","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0022-247X(66)90060-6","volume":"14","author":"J. MacQueen","year":"1966","unstructured":"J. MacQueen, A modified dynamic programming method for Markov decision processes, J. Math. Anal. Appl. 14 (1966) 38\u201343.","journal-title":"J. Math. Anal. Appl."},{"key":"BF02283617_CR8","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/opre.30.1.62","volume":"30","author":"R. Mendelssohn","year":"1982","unstructured":"R. Mendelssohn, An iterative aggregation procedure for Markov decision processes, Oper. Res. 30 (1982) 62\u201373.","journal-title":"Oper. Res."},{"key":"BF02283617_CR9","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/1031050","volume":"31","author":"C.D. Meyer","year":"1989","unstructured":"C.D. Meyer, Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems, SIAM Rev. 31 (1989) 240\u2013272.","journal-title":"SIAM Rev."},{"key":"BF02283617_CR10","first-page":"296","volume":"24","author":"K. Ohno","year":"1981","unstructured":"K. Ohno, A unified approach to algorithms with suboptimality test in discounted semi-Markov decision processes, J. Oper. Res. Soc. Japan 24 (1981) 296\u2013324.","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"BF02283617_CR11","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/0022-247X(68)90178-9","volume":"22","author":"S. Osaki","year":"1968","unstructured":"S. Osaki and H. Mine, Linear programming algorithms for semi-Markovian decision processes, J. Math. Anal. Appl. 22 (1968) 256\u2013281.","journal-title":"J. Math. Anal. Appl."},{"key":"BF02283617_CR12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TAC.1979.1102063","volume":"AC-24","author":"J.L. Popyack","year":"1979","unstructured":"J.L. Popyack, R.L. Brown and C.C. White III, Discrete version of an algorithm due to Varaiya, IEEE Trans. Automatic Control AC-24 (1979) 503\u2013504.","journal-title":"IEEE Trans. Automatic Control"},{"key":"BF02283617_CR13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1287\/mnsc.18.1.7","volume":"8","author":"E. Porteus","year":"1971","unstructured":"E. Porteus, Some bounds for discounted sequential decision processes, Manag. Sci. 8 (1971) 7\u201311.","journal-title":"Manag. Sci."},{"key":"BF02283617_CR14","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/0022-247X(87)90317-9","volume":"123","author":"P.J. Schweitzer","year":"1987","unstructured":"P.J. Schweitzer, Bounds on the fixed point of a monotone contraction operator, J. Math. Anal. Appl. 123 (1987) 376\u2013388.","journal-title":"J. Math. Anal. Appl."},{"key":"BF02283617_CR15","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0022-247X(88)90316-2","volume":"130","author":"P.J. Schweitzer","year":"1988","unstructured":"P.J. Schweitzer, Solving Markovian decision process by successive elimination of variables, J. Math. Anal. Appl. 130 (1988) 403\u2013419.","journal-title":"J. Math. Anal. Appl."},{"key":"BF02283617_CR16","first-page":"53","volume-title":"Proc. 1st Int. Workshop on the Numerical Solution of Markov Chains","author":"P.J. Schweitzer","year":"1990","unstructured":"P.J. Schweitzer, A survey of aggregation-disaggregation in large Markov chains,Proc. 1st Int. Workshop on the Numerical Solution of Markov Chains, University of North Carolina, Raleigh, North Carolina (January 8\u201310, 1990) pp. 53\u201380."},{"key":"BF02283617_CR17","unstructured":"P.J. Schweitzer, An iterative aggregation-disaggregation algorithm for discounted Markov renewal programming, in preparation."},{"key":"BF02283617_CR18","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1287\/opre.33.3.589","volume":"33","author":"P.J. Schweitzer","year":"1985","unstructured":"P.J. Schweitzer, M. Puterman and K.W. Kindle, Iterative aggregation-disaggregation procedures for discounted semi-Markovian reward processes, Oper. Res. 33 (1985) 589\u2013605.","journal-title":"Oper. Res."},{"key":"BF02283617_CR19","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0096-3003(86)90003-2","volume":"18","author":"P.J. Schweitzer","year":"1986","unstructured":"P.J. Schweitzer and K.W. Kindle, An iterative aggregation-disaggregation algorithm for solving linear equations, Appl. Math. Comp. 18 (1986) 313\u2013354.","journal-title":"Appl. Math. Comp."},{"key":"BF02283617_CR20","unstructured":"P.J. Schweitzer, U. Sumita and K. Ohno, Replacement process decomposition for relative values in discounted Markov renewal programming, in preparation."},{"key":"BF02283617_CR21","unstructured":"P.J. Schweitzer, U. Sumita and K. Ohno, Replacement process decomposition for undiscounted Markov renewal programming, in preparation."},{"key":"BF02283617_CR22","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0377-2217(86)90222-5","volume":"23","author":"L.P. Seelen","year":"1986","unstructured":"L.P. Seelen, An algorithm forPh\/Ph\/c queues, Europ. J. Oper. Res. 23 (1986) 118\u2013127.","journal-title":"Europ. J. Oper. Res."},{"key":"BF02283617_CR23","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1017\/S0269964800001479","volume":"4","author":"U. Sumita","year":"1990","unstructured":"U. Sumita and M. Rieders, A new algorithm for computing the ergodic probability vector for large Markov chains: replacement process approach, Prob. Eng. Infor. Sci. 4 (1990) 89\u2013116.","journal-title":"Prob. Eng. Infor. Sci."},{"key":"BF02283617_CR24","doi-asserted-by":"crossref","unstructured":"U. Sumita and M. Rieders, Application of the replacement process approach for computing the ergodic probability vector for large-scale row-continuous Markov chains, University of Rochester, W.E. Simon Graduate School of Business Administration, Working Paper Series QM 88-10 (revised April 1990).","DOI":"10.15807\/jorsj.33.279"},{"key":"BF02283617_CR25","first-page":"309","volume-title":"Proc. 1st Int. Workshop on the Numerical Solution of Markov Chains","author":"U. Sumita","year":"1990","unstructured":"U. Sumita and M. Rieders, Numerical comparison of the replacement process approach with the aggregation-disaggregation algorithm for row-continuous Markov chains,Proc. 1st Int. Workshop on the Numerical Solution of Markov Chains, University of North Carolina, Raleigh, North Carolina (January 8\u201310, 1990) pp. 309\u2013327."},{"key":"BF02283617_CR26","unstructured":"U. Sumita, P.J. Schweitzer and K. Ohno, A replacement process approach for solving a large system of linear equations, in preparation."},{"key":"BF02283617_CR27","unstructured":"Y. Takahashi, A lumping method for numerical calculations of stationary distributions of Markov chains, Research Report No. B-18, Dept. of Information Sciences, Tokyo Institute of Technology (1975)."},{"key":"BF02283617_CR28","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1287\/moor.10.2.220","volume":"10","author":"K.-H. Waldman","year":"1985","unstructured":"K.-H. Waldman, On bounds for dynamic programs, Math. Oper. Res. 10 (1985) 220\u2013232.","journal-title":"Math. Oper. Res."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02283617.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02283617\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02283617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T08:55:42Z","timestamp":1683363342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02283617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF02283617"],"URL":"https:\/\/doi.org\/10.1007\/bf02283617","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}