{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:45:01Z","timestamp":1740138301268,"version":"3.37.3"},"reference-count":18,"publisher":"Informa UK Limited","issue":"4","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11831002"],"award-info":[{"award-number":["11831002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2020,7,3]]},"DOI":"10.1080\/10556788.2019.1695131","type":"journal-article","created":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T12:03:43Z","timestamp":1575979423000},"page":"706-721","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Towards solving 2-TBSG efficiently"],"prefix":"10.1080","volume":"35","author":[{"given":"Zeyu","family":"Jia","sequence":"first","affiliation":[{"name":"School of Mathematical Science, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zaiwen","family":"Wen","sequence":"additional","affiliation":[{"name":"Beijing International Center for Mathematical Research, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[{"name":"Department of Management Science and Engineering, Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2019,12,10]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1126\/science.153.3731.34"},{"key":"CIT0002","volume-title":"Dynamic\u00a0Programming and\u00a0Optimal\u00a0Control","volume":"1","author":"Bertsekas D.P.","year":"1995"},{"key":"CIT0003","unstructured":"C. Derman, Finite State Markov Decision Processes, Academic Press, New York, 1970."},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14162-1_46"},{"volume-title":"Competitive Markov\u00a0Decision\u00a0Processes","year":"2012","author":"Filar J.","key":"CIT0005"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.27"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1145\/2432622.2432623"},{"key":"CIT0008","unstructured":"R.A Howard, Dynamic Programming and Markov Processes, MIT Press, Cambridge, 1960."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69407-6_32"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-0189-2"},{"key":"CIT0011","unstructured":"I. Post and Y. Ye, The simplex method is strongly polynomial for deterministic Markov decision processes, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'13, Philadelphia, PA, 2013. Society for Industrial and Applied Mathematics, pp. 1465\u20131473. ISBN 978-1-611972-51-1."},{"volume-title":"Markov\u00a0Decision\u00a0Processes:\u00a0Discrete\u00a0Stochastic\u00a0Dynamic\u00a0Programming","year":"2014","author":"Puterman M.L.","key":"CIT0012"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1007\/BF00935562"},{"key":"CIT0014","unstructured":"B. Scherrer, Improved and generalized upper bounds on the complexity of policy iteration, in Proceedings of the Twenty-Seventh Conference on Advances in Neural Information Processing Systems, 2013, pp. 386\u2013394."},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.39.10.1953"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1038\/nature16961"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1050.0149"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1110.0516"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2019.1695131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T07:45:21Z","timestamp":1619941521000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2019.1695131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,10]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7,3]]}},"alternative-id":["10.1080\/10556788.2019.1695131"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2019.1695131","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2019,12,10]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-06-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-11-16","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}