{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:06:45Z","timestamp":1648908405420},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T00:00:00Z","timestamp":1486339200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s11590-017-1111-3","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T14:22:26Z","timestamp":1486390946000},"page":"1477-1487","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reformulation of the linear program for completely ergodic MDPs with average cost criteria"],"prefix":"10.1007","volume":"11","author":[{"given":"Vahid","family":"Hashemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,6]]},"reference":[{"issue":"6","key":"1111_CR1","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.39.6.955","volume":"39","author":"I Adler","year":"1991","unstructured":"Adler, I., Cosares, S.T.: A strongly polynomial algorithm for a special class of linear programs. Oper. Res. 39(6), 955\u2013960 (1991)","journal-title":"Oper. Res."},{"key":"1111_CR2","volume-title":"Network Flows Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.J., Orlin, J.B.: Network Flows Theory, Algorithms, and Applications. Prentice Hall, Prentice (1993)"},{"issue":"10","key":"1111_CR3","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1073\/pnas.42.10.767","volume":"42","author":"R Bellman","year":"1956","unstructured":"Bellman, R.: Dynamic programming and lagrange multipliers. Proc. Nat. Acad. Sci. 42(10), 767\u2013769 (1956)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"1111_CR4","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)"},{"key":"1111_CR5","doi-asserted-by":"crossref","unstructured":"Bozga, M., David, A., Hartmanns, A., Hermanns, H., Larsen, K.G., Legay, A., Tretmans, J.: State-of-the-art tools and techniques for quantitative modeling and analysis of embedded systems. In: Proceedings of the Conference on Design, Automation and Test in Europe, pp. 370\u2013375. EDA Consortium (2012)","DOI":"10.1109\/DATE.2012.6176499"},{"key":"1111_CR6","volume-title":"Linear Programming and Extensions","author":"GB Dantzig","year":"1998","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1998)"},{"key":"1111_CR7","doi-asserted-by":"crossref","unstructured":"Forejt, V., Kwiatkowska, M.Z., Norman, G., Parker, D.: Automated verification techniques for probabilistic systems. In: SFM, pp. 53\u2013113 (2011)","DOI":"10.1007\/978-3-642-21455-4_3"},{"key":"1111_CR8","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Complexity, oracles, and numerical computation. In: Geometric Algorithms and Combinatorial Optimization, pp. 21\u201345. Springer (1988)","DOI":"10.1007\/978-3-642-97881-4_2"},{"issue":"1","key":"1111_CR9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1013548430005","volume":"21","author":"N G\u00fclpinar","year":"2002","unstructured":"G\u00fclpinar, N., Mitra, G., Maros, I.: Creating advanced bases for large scale linear programs exploiting embedded network structure. Comput. Optim. Appl. 21(1), 71\u201393 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"1111_CR10","doi-asserted-by":"crossref","unstructured":"Hahn, E.M., Li, Y., Schewe, S., Turrini, A., Zhang, L.: Iscasmc: A web-based probabilistic model checker. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014: Formal Methods, pp. 312\u2013317. Springer (2014)","DOI":"10.1007\/978-3-319-06410-9_22"},{"key":"1111_CR11","doi-asserted-by":"crossref","unstructured":"Hashemi, V., Hermanns, H., Song, L.: Reward-bounded reachability probability for uncertain weighted MDPs. In: Jobstmann, B., Leino, K. (eds.) Verification, Model Checking, and Abstract Interpretation, vol 9583. pp. 351\u2013371. Springer, Berlin (2016)","DOI":"10.1007\/978-3-662-49122-5_17"},{"key":"1111_CR12","volume-title":"Dynamic Programming and Markov Processes","author":"RA Howard","year":"1960","unstructured":"Howard, R.A.: Dynamic Programming and Markov Processes. MIT, Cambridge (1960)"},{"issue":"4","key":"1111_CR13","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"1111_CR14","volume-title":"Principles of Model Checking","author":"JP Katoen","year":"2008","unstructured":"Katoen, J.P., Baier, C.: Principles of Model Checking. MIT press, Cambridge (2008)"},{"issue":"1","key":"1111_CR15","first-page":"191","volume":"20","author":"LG Khachyan","year":"1979","unstructured":"Khachyan, L.G.: A polynomial algorithm in linear programming. Sov. Math. Dokl. 20(1), 191\u2013194 (1979)","journal-title":"Sov. Math. Dokl."},{"key":"1111_CR16","unstructured":"Klee, V., Minty, G.J.: How good is the simplex algorithm? In: Inequalities, vol. III, pp. 159\u2013175. Defense Technical Information Center (1972)"},{"key":"1111_CR17","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Prism 4.0: Verification of probabilistic real-time systems. In: Computer Aided Verification, pp. 585\u2013591. Springer (2011)","DOI":"10.1007\/978-3-642-22110-1_47"},{"key":"1111_CR18","doi-asserted-by":"crossref","DOI":"10.1201\/b17476","volume-title":"Machine Learning an Algorithmic Perspective","author":"S Marsland","year":"2014","unstructured":"Marsland, S.: Machine Learning an Algorithmic Perspective. CRC Press, Boca Raton (2014)"},{"key":"1111_CR19","volume-title":"Markovian Decision Process","author":"H Mine","year":"1970","unstructured":"Mine, H., Osaki, S.: Markovian Decision Process. American Elsevier Publishing Co., New York (1970)"},{"issue":"1","key":"1111_CR20","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.1110.0485","volume":"25","author":"DR Morrison","year":"2013","unstructured":"Morrison, D.R., Sauppe, J.J., Jacobson, S.H.: A network simplex algorithm for the equal flow problem on a generalized network. INFORMS J. Comput. 25(1), 2\u201312 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"1111_CR21","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1007\/s11590-013-0634-5","volume":"8","author":"DR Morrison","year":"2014","unstructured":"Morrison, D.R., Sauppe, J.J., Jacobson, S.H.: An algorithm to solve the proportional network flow problem. Optim. Lett. 8(3), 801\u2013809 (2014)","journal-title":"Optim. Lett."},{"key":"1111_CR22","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0927-0507(05)80172-0","volume":"2","author":"ML Puterman","year":"1990","unstructured":"Puterman, M.L.: Markov decision processes. Handb. Oper. Res. Manag. Sci. 2, 331\u2013434 (1990)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"1111_CR23","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"2014","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York (2014)"},{"issue":"3","key":"1111_CR24","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/mnsc.33.3.301","volume":"33","author":"R Shamir","year":"1987","unstructured":"Shamir, R.: The efficiency of the simplex method: a survey. Manag. Sci. 33(3), 301\u2013334 (1987)","journal-title":"Manag. Sci."},{"key":"1111_CR25","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/moor.27.3.445.313","volume":"27","author":"KD Wayne","year":"2002","unstructured":"Wayne, K.D.: A polynomial combinatorial algorithm for generalized minimum cost flow. Math. Oper. Res. 27, 445\u2013459 (2002)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1111_CR26","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1287\/moor.1050.0149","volume":"30","author":"Y Ye","year":"2005","unstructured":"Ye, Y.: A new complexity result on solving the markov decision problem. Math. Oper. Res. 30(3), 733\u2013749 (2005)","journal-title":"Math. Oper. Res."},{"key":"1111_CR27","unstructured":"Ye, Y.: The simplex method is strongly polynomial for the Markov decision problem with a fixed discount rate. Working paper, Department of Management Science and Engineering, Stanford University. Stanford, CA. http:\/\/www.stanford.edu\/~yyye\/simplexmdp1.pdf (2010)"},{"issue":"4","key":"1111_CR28","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1287\/moor.1110.0516","volume":"36","author":"Y Ye","year":"2011","unstructured":"Ye, Y.: The simplex and policy-iteration methods are strongly polynomial for the markov decision problem with a fixed discount rate. Math. Oper. Res. 36(4), 593\u2013603 (2011)","journal-title":"Math. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1111-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1111-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1111-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:50:02Z","timestamp":1568785802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1111-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,6]]},"references-count":28,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["1111"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1111-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,6]]}}}