{"id":"https://openalex.org/W2103263079","doi":"https://doi.org/10.7551/mitpress/1120.003.0093","title":"Approximate Dynamic Programming via Linear Programming","display_name":"Approximate Dynamic Programming via Linear Programming","publication_year":2002,"publication_date":"2002-11-08","ids":{"openalex":"https://openalex.org/W2103263079","doi":"https://doi.org/10.7551/mitpress/1120.003.0093","mag":"2103263079"},"language":"en","primary_location":{"id":"doi:10.7551/mitpress/1120.003.0093","doi":"https://doi.org/10.7551/mitpress/1120.003.0093","is_oa":false,"landing_page_url":"https://doi.org/10.7551/mitpress/1120.003.0093","pdf_url":null,"source":{"id":"https://openalex.org/S4306463997","display_name":"The MIT Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Neural Information Processing Systems 14","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W2999905431","display_name":"Advances in Neural Information Processing Systems 14"},"type":"book-chapter","is_traditional":true,"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/A5026141042","display_name":"Daniela Pucci de Farias","orcid":"https://orcid.org/0000-0003-3277-6017","observed_orcids":["https://orcid.org/0000-0003-3277-6017"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniela Pucci de Farias","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5045543562","display_name":"Benjamin Van Roy","orcid":"https://orcid.org/0000-0001-8364-3746","observed_orcids":["https://orcid.org/0000-0001-8364-3746"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Van Roy","raw_affiliation_strings":["Department of Management Science & Engineering, Stanford University, Stanford, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Science & Engineering, Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2689,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.95193591,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"689","last_page":"696"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.8984000086784363,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.8984000086784363,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.026599999517202377,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.022299999371170998,"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/approximate-dynamic-programming","display_name":"approximate dynamic programming","score":0.9980000257492065},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.8259999752044678},{"id":"https://openalex.org/keywords/stochastic-control","display_name":"stochastic control","score":0.8240000009536743},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"curse of dimensionality","score":0.9800000190734863},{"id":"https://openalex.org/keywords/value-function","display_name":"value function","score":0.7979999780654907},{"id":"https://openalex.org/keywords/basis-functions","display_name":"basis functions","score":0.7649999856948853},{"id":"https://openalex.org/keywords/approximation-error-estimates","display_name":"approximation error bounds","score":0.996999979019165},{"id":"https://openalex.org/keywords/large-scale-optimization","display_name":"large-scale optimization","score":0.8579999804496765}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.572090208530426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5539110898971558},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4540763795375824},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4099684953689575},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.366554319858551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2538684010505676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2431831657886505}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.7551/mitpress/1120.003.0093","doi":"https://doi.org/10.7551/mitpress/1120.003.0093","is_oa":false,"landing_page_url":"https://doi.org/10.7551/mitpress/1120.003.0093","pdf_url":null,"source":{"id":"https://openalex.org/S4306463997","display_name":"The MIT Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Neural Information Processing Systems 14","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.8736","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.8736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-2.cs.cmu.edu/Groups/NIPS/NIPS2001/papers/psgz/AA04.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.924.1208","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.924.1208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://papers.nips.cc/paper/2129-approximate-dynamic-programming-via-linear-programming.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1964535365","https://openalex.org/W2040766536","https://openalex.org/W2093892790"],"related_works":["https://openalex.org/W2911243654","https://openalex.org/W2222696761","https://openalex.org/W7099442746","https://openalex.org/W2167519341","https://openalex.org/W2130084536","https://openalex.org/W2013501221","https://openalex.org/W7161108221","https://openalex.org/W7095914634","https://openalex.org/W2341507301","https://openalex.org/W2111753883"],"abstract_inverted_index":{"The":[0,37],"curse":[1],"of":[2,16,44,71],"dimensionality":[3],"gives":[4],"rise":[5],"to":[6,34,49],"prohibitive":[7],"computational":[8],"requirements":[9],"that":[10],"render":[11],"infeasible":[12],"the":[13,50,61,69,79],"exact":[14],"solution":[15],"large-":[17],"scale":[18],"stochastic":[19],"control":[20],"problems.":[21],"We":[22,57],"study":[23],"an":[24],"efficient":[25],"method":[26],"based":[27],"on":[28,60],"linear":[29,42],"programming":[30,52],"for":[31,78],"approximating":[32],"solutions":[33],"such":[35],"prob-lems.":[36],"approach":[38],"\"fits":[39],"\"":[40],"a":[41],"combination":[43],"pre-":[45],"selected":[46],"basis":[47],"functions":[48],"dynamic":[51],"cost-":[53],"to-":[54],"go":[55],"function.":[56],"develop":[58],"bounds":[59],"approximation":[62],"error":[63],"and":[64],"present":[65],"experi-mental":[66],"results":[67],"in":[68],"domain":[70],"queueing":[72],"network":[73],"control,":[74],"providing":[75],"empirical":[76],"support":[77],"methodology.":[80],"1":[81]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}