{"id":"https://openalex.org/W2021512803","doi":"https://doi.org/10.1016/s0305-0548(03)00190-4","title":"Policy iteration type algorithms for recurrent state Markov decision processes","display_name":"Policy iteration type algorithms for recurrent state Markov decision processes","publication_year":2003,"publication_date":"2003-07-16","ids":{"openalex":"https://openalex.org/W2021512803","doi":"https://doi.org/10.1016/s0305-0548(03)00190-4","mag":"2021512803"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(03)00190-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(03)00190-4","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039633806","display_name":"Stephen D. Patek","orcid":null},"institutions":[{"id":"https://openalex.org/I4210088597","display_name":"Urology of Virginia","ror":"https://ror.org/009w2dq98","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210088597"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Stephen D. Patek","raw_affiliation_strings":["Department of Systems and Information Engineering, UVA, 151 Engineers Way, P.O. Box 400747, Charlottesville, VA 22904, USA","Department of Systems and Information Engineering, UVA, 151 Engineers Way, P.O. Box 400747, Charlottesville, VA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Systems and Information Engineering, UVA, 151 Engineers Way, P.O. Box 400747, Charlottesville, VA 22904, USA","institution_ids":["https://openalex.org/I4210088597"]},{"raw_affiliation_string":"Department of Systems and Information Engineering, UVA, 151 Engineers Way, P.O. Box 400747, Charlottesville, VA#TAB#","institution_ids":["https://openalex.org/I4210088597"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039633806"],"corresponding_institution_ids":["https://openalex.org/I4210088597"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.13967895,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"31","issue":"14","first_page":"2333","last_page":"2347"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9814000129699707,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.8035914897918701},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.601258397102356},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.599018394947052},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5957807898521423},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5459498763084412},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5402870178222656},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.527647852897644},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5052376389503479},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5044347047805786},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.458290696144104},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4483613967895508},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4371170997619629},{"id":"https://openalex.org/keywords/average-cost","display_name":"Average cost","score":0.4331486225128174},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3855176568031311},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1243104338645935}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.8035914897918701},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.601258397102356},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.599018394947052},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5957807898521423},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5459498763084412},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5402870178222656},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.527647852897644},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5052376389503479},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5044347047805786},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.458290696144104},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4483613967895508},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4371170997619629},{"id":"https://openalex.org/C2780958618","wikidata":"https://www.wikidata.org/wiki/Q945621","display_name":"Average cost","level":2,"score":0.4331486225128174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3855176568031311},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1243104338645935},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C133425853","wikidata":"https://www.wikidata.org/wiki/Q60571","display_name":"Neoclassical economics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0305-0548(03)00190-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(03)00190-4","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7599999904632568,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1544193923","https://openalex.org/W1967037758","https://openalex.org/W1983062642","https://openalex.org/W2020623277","https://openalex.org/W2040129529","https://openalex.org/W2059648440","https://openalex.org/W2060219734","https://openalex.org/W2081287319","https://openalex.org/W2097961801","https://openalex.org/W2098432798","https://openalex.org/W2103406407","https://openalex.org/W2107037985","https://openalex.org/W2119567691","https://openalex.org/W2119888572","https://openalex.org/W2123120471","https://openalex.org/W2132291040","https://openalex.org/W2139024073","https://openalex.org/W2290051315","https://openalex.org/W2313728779","https://openalex.org/W2319587272","https://openalex.org/W2335472932","https://openalex.org/W4210912080","https://openalex.org/W4285719527","https://openalex.org/W4298023569","https://openalex.org/W6696290282"],"related_works":["https://openalex.org/W2379651310","https://openalex.org/W1541249122","https://openalex.org/W2113019827","https://openalex.org/W2413828414","https://openalex.org/W2367222340","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532","https://openalex.org/W2097475492","https://openalex.org/W2090383517"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}