{"id":"https://openalex.org/W4404239397","doi":"https://doi.org/10.1109/icstcc62912.2024.10744767","title":"Dual-Sourcing via Dynamic Programming with Monte Carlo Value Approximation","display_name":"Dual-Sourcing via Dynamic Programming with Monte Carlo Value Approximation","publication_year":2024,"publication_date":"2024-10-10","ids":{"openalex":"https://openalex.org/W4404239397","doi":"https://doi.org/10.1109/icstcc62912.2024.10744767"},"language":"en","primary_location":{"id":"doi:10.1109/icstcc62912.2024.10744767","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icstcc62912.2024.10744767","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 28th International Conference on System Theory, Control and Computing (ICSTCC)","raw_type":"proceedings-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/A5037690599","display_name":"Larkin Liu","orcid":"https://orcid.org/0000-0002-9375-1035"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Larkin Liu","raw_affiliation_strings":["Technical University of Munich"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Munich","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037690599"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2766525,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"315","last_page":"322"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11043","display_name":"Merger and Competition Analysis","score":0.7851999998092651,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11043","display_name":"Merger and Competition Analysis","score":0.7851999998092651,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.7121999859809875,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.7049999833106995,"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/monte-carlo-method","display_name":"Monte Carlo method","score":0.6958378553390503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6052942276000977},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.567601203918457},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.45355942845344543},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.44404393434524536},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3653779625892639},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17899388074874878},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1481453776359558},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08308267593383789},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08152952790260315}],"concepts":[{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.6958378553390503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6052942276000977},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.567601203918457},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.45355942845344543},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.44404393434524536},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3653779625892639},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17899388074874878},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1481453776359558},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08308267593383789},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08152952790260315},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icstcc62912.2024.10744767","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icstcc62912.2024.10744767","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 28th International Conference on System Theory, Control and Computing (ICSTCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1480153478","https://openalex.org/W1759945374","https://openalex.org/W2020677396","https://openalex.org/W2031832347","https://openalex.org/W2039683310","https://openalex.org/W2045268668","https://openalex.org/W2054561613","https://openalex.org/W2062457326","https://openalex.org/W2069177951","https://openalex.org/W2090366750","https://openalex.org/W2106192895","https://openalex.org/W2109910161","https://openalex.org/W2110040537","https://openalex.org/W2117355432","https://openalex.org/W2119401963","https://openalex.org/W2127576890","https://openalex.org/W2134932665","https://openalex.org/W2162487062","https://openalex.org/W2164900907","https://openalex.org/W2169982856","https://openalex.org/W2463349810","https://openalex.org/W2488808246","https://openalex.org/W2751667090","https://openalex.org/W2886362482","https://openalex.org/W2965309826","https://openalex.org/W3201716076","https://openalex.org/W4213251304","https://openalex.org/W4297081765","https://openalex.org/W4298857966","https://openalex.org/W6604666559","https://openalex.org/W6637967152","https://openalex.org/W6677549092","https://openalex.org/W6755878414"],"related_works":["https://openalex.org/W2393870460","https://openalex.org/W2254578859","https://openalex.org/W4284894156","https://openalex.org/W2161803855","https://openalex.org/W3110774753","https://openalex.org/W2134539662","https://openalex.org/W2059096050","https://openalex.org/W2093391715","https://openalex.org/W1972737581","https://openalex.org/W814774360"],"abstract_inverted_index":{"In":[0],"large":[1,65,103],"scale":[2,66,104],"global":[3],"supply":[4,60],"chains,":[5],"the":[6,27,37,41,64,68,96,102,117,122,128,146],"inventory":[7,19,38],"cost":[8,28,39],"sensitivity":[9],"due":[10,62],"to":[11,25,35,63,94,100,114,116,160],"supplier":[12,30],"disruption":[13,161],"can":[14],"be":[15],"high.":[16],"Dual-sourcing,":[17],"a":[18],"policy":[20,119],"which":[21,89],"leverages":[22],"two":[23],"suppliers":[24,158],"minimize":[26,36],"of":[29,43,67,130,149],"disruption,":[31],"is":[32,111,141],"often":[33,144],"applied":[34],"in":[40,58,155],"face":[42],"uncertain":[44],"lead":[45],"times":[46],"and":[47,143],"consumer":[48],"demand.":[49],"However,":[50],"computing":[51],"optimal":[52,97,118],"policies":[53],"for":[54],"dual-sourcing":[55,105,152],"faces":[56],"challenges":[57],"modern":[59],"chains":[61],"system.":[69],"We":[70,107],"introduce":[71],"Dyanmic":[72],"Programming":[73],"with":[74,85],"Monte":[75,91,131],"Carlo":[76,92,132],"Value":[77],"Approximation":[78],"(DPMC),":[79],"an":[80],"approximate":[81],"dynamic":[82],"programming":[83],"algorithm":[84],"polynomial":[86],"time":[87],"complexity":[88],"applies":[90],"simulation":[93],"estimate":[95],"value":[98,123],"function":[99,124],"address":[101],"problem.":[106],"show":[108],"that":[109,139],"DPMC":[110,140],"theoretically":[112],"guaranteed":[113],"converge":[115],"by":[120],"improving":[121],"approximator":[125],"and/or":[126,162],"increasing":[127],"number":[129],"iterations.":[133],"Via":[134],"empirical":[135],"simulation,":[136],"we":[137],"demonstrate":[138],"competitive":[142],"exceeds":[145],"cost-minimizing":[147],"performance":[148],"other":[150],"state-of-the-art":[151],"policies,":[153],"specifically":[154],"scenarios":[156],"where":[157],"subject":[159],"fixed":[163],"ordering":[164],"costs.":[165]},"counts_by_year":[],"updated_date":"2025-12-27T23:08:20.325037","created_date":"2025-10-10T00:00:00"}