{"id":"https://openalex.org/W2012993894","doi":"https://doi.org/10.1007/978-3-642-40450-4_49","title":"A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs","display_name":"A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2012993894","doi":"https://doi.org/10.1007/978-3-642-40450-4_49","mag":"2012993894"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-40450-4_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40450-4_49","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5000432625","display_name":"Nir Halman","orcid":"https://orcid.org/0000-0002-6098-9792"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]},{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"Nir Halman","raw_affiliation_strings":["Dept. of Civil and Environmental Engineering, MIT, Cambridge, MA, USA","Jerusalem School of Business Administration, The Hebrew University, Jerusalem, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Civil and Environmental Engineering, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"Jerusalem School of Business Administration, The Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005485061","display_name":"Giacomo Nannicini","orcid":"https://orcid.org/0000-0002-4936-1259"},"institutions":[{"id":"https://openalex.org/I152815399","display_name":"Singapore University of Technology and Design","ror":"https://ror.org/05j6fvn87","country_code":"SG","type":"education","lineage":["https://openalex.org/I152815399"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Giacomo Nannicini","raw_affiliation_strings":["Singapore University of Technology and Design, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Singapore University of Technology and Design, Singapore","institution_ids":["https://openalex.org/I152815399"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"James Orlin","raw_affiliation_strings":["Sloan School of Management, MIT, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sloan School of Management, MIT, Cambridge, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005485061","https://openalex.org/A5072685560"],"corresponding_institution_ids":["https://openalex.org/I152815399"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4769,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60923077,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"577","last_page":"588"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9962000250816345,"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"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7088866829872131},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6254758834838867},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6217925548553467},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5566196441650391},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.549674391746521},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5430599451065063},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5066922307014465},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4217471778392792},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.421555757522583},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41699647903442383},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4167748689651489},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20773249864578247}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7088866829872131},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6254758834838867},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6217925548553467},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5566196441650391},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.549674391746521},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5430599451065063},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5066922307014465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4217471778392792},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.421555757522583},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41699647903442383},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4167748689651489},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20773249864578247},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-40450-4_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40450-4_49","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1997261476","https://openalex.org/W2000124998","https://openalex.org/W2059676477","https://openalex.org/W2098432798","https://openalex.org/W2101831095","https://openalex.org/W2111318609","https://openalex.org/W2150462602","https://openalex.org/W2341171179","https://openalex.org/W4206054140","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3022397687","https://openalex.org/W2048358792","https://openalex.org/W173299344","https://openalex.org/W2166199145","https://openalex.org/W2608180361","https://openalex.org/W1982537107","https://openalex.org/W2591109193","https://openalex.org/W2040050205","https://openalex.org/W2783517978","https://openalex.org/W2035966498","https://openalex.org/W22271769","https://openalex.org/W1588499150","https://openalex.org/W2121972349","https://openalex.org/W2027049731","https://openalex.org/W2164056371","https://openalex.org/W3010830146","https://openalex.org/W2048772520","https://openalex.org/W1551497449","https://openalex.org/W2057178844","https://openalex.org/W2032571681"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}