{"id":"https://openalex.org/W4225566331","doi":"https://doi.org/10.1109/infocom48880.2022.9796715","title":"Learning for Robust Combinatorial Optimization: Algorithm and Application","display_name":"Learning for Robust Combinatorial Optimization: Algorithm and Application","publication_year":2022,"publication_date":"2022-05-02","ids":{"openalex":"https://openalex.org/W4225566331","doi":"https://doi.org/10.1109/infocom48880.2022.9796715"},"language":"en","primary_location":{"id":"doi:10.1109/infocom48880.2022.9796715","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom48880.2022.9796715","pdf_url":null,"source":{"id":"https://openalex.org/S4363607980","display_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","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/A5025693404","display_name":"Zhihui Shao","orcid":"https://orcid.org/0000-0003-4531-3417"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhihui Shao","raw_affiliation_strings":["UC Riverside"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UC Riverside","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107636936","display_name":"Jianyi Yang","orcid":"https://orcid.org/0000-0003-2912-7737"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jianyi Yang","raw_affiliation_strings":["UC Riverside"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UC Riverside","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016749653","display_name":"Cong Shen","orcid":"https://orcid.org/0000-0002-3148-4453"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cong Shen","raw_affiliation_strings":["University of Virginia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Virginia","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000834239","display_name":"Shaolei Ren","orcid":"https://orcid.org/0000-0001-9003-4324"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shaolei Ren","raw_affiliation_strings":["UC Riverside"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UC Riverside","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.354,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.66061036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"930","last_page":"939"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12535","display_name":"Machine Learning and Data Classification","score":0.9904000163078308,"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.9896000027656555,"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/computer-science","display_name":"Computer science","score":0.7104321718215942},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.667519211769104},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6198039054870605},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.5776631236076355},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5648304224014282},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5424143075942993},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.4766809940338135},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4358466565608978},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37930992245674133},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.32431337237358093},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25660818815231323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18580418825149536}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7104321718215942},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.667519211769104},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6198039054870605},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.5776631236076355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5648304224014282},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5424143075942993},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.4766809940338135},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4358466565608978},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37930992245674133},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.32431337237358093},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25660818815231323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18580418825149536},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom48880.2022.9796715","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom48880.2022.9796715","pdf_url":null,"source":{"id":"https://openalex.org/S4363607980","display_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":64,"referenced_works":["https://openalex.org/W1522301498","https://openalex.org/W1835792195","https://openalex.org/W2002313126","https://openalex.org/W2020123437","https://openalex.org/W2046938271","https://openalex.org/W2060732452","https://openalex.org/W2069323107","https://openalex.org/W2095577883","https://openalex.org/W2130515279","https://openalex.org/W2137983211","https://openalex.org/W2416799949","https://openalex.org/W2563592268","https://openalex.org/W2607264901","https://openalex.org/W2616867685","https://openalex.org/W2624086852","https://openalex.org/W2624915851","https://openalex.org/W2749647640","https://openalex.org/W2765094320","https://openalex.org/W2805372960","https://openalex.org/W2805798351","https://openalex.org/W2918314918","https://openalex.org/W2920334458","https://openalex.org/W2946554127","https://openalex.org/W2951634833","https://openalex.org/W2952332632","https://openalex.org/W2953228531","https://openalex.org/W2963775850","https://openalex.org/W2965598369","https://openalex.org/W2968986602","https://openalex.org/W2981188016","https://openalex.org/W2985805335","https://openalex.org/W2992716901","https://openalex.org/W2998327136","https://openalex.org/W3014068862","https://openalex.org/W3027146252","https://openalex.org/W3047863327","https://openalex.org/W3099068521","https://openalex.org/W3100003759","https://openalex.org/W3106780213","https://openalex.org/W3132256512","https://openalex.org/W3137965023","https://openalex.org/W4214717370","https://openalex.org/W4250589301","https://openalex.org/W4292027170","https://openalex.org/W4320013936","https://openalex.org/W6631190155","https://openalex.org/W6651176272","https://openalex.org/W6714477741","https://openalex.org/W6717367658","https://openalex.org/W6725207838","https://openalex.org/W6730742100","https://openalex.org/W6735618850","https://openalex.org/W6736495275","https://openalex.org/W6739097064","https://openalex.org/W6739653404","https://openalex.org/W6744644060","https://openalex.org/W6752213908","https://openalex.org/W6763262767","https://openalex.org/W6766984874","https://openalex.org/W6769434743","https://openalex.org/W6769737877","https://openalex.org/W6784273276","https://openalex.org/W6790885509","https://openalex.org/W6792219651"],"related_works":["https://openalex.org/W4200062060","https://openalex.org/W2335109106","https://openalex.org/W3182145356","https://openalex.org/W2002696586","https://openalex.org/W2793423758","https://openalex.org/W2074145420","https://openalex.org/W3149055374","https://openalex.org/W2053131036","https://openalex.org/W2216231335","https://openalex.org/W3195104199"],"abstract_inverted_index":{"Learning":[0],"to":[1,11,37,64],"optimize":[2],"(L2O)":[3],"has":[4,34],"recently":[5],"emerged":[6],"as":[7,150],"a":[8,40,70,102,116,127,199],"promising":[9],"approach":[10],"solving":[12],"optimization":[13,50,56,76,81,99],"problems":[14,46],"by":[15],"exploiting":[16],"the":[17,52,65,79,120,135,138,141,157,167,175,191],"strong":[18],"prediction":[19],"power":[20],"of":[21,45,54,122,129,159,169],"neural":[22],"networks":[23],"and":[24,87,100,137,152,194],"offering":[25],"lower":[26],"runtime":[27,202],"complexity":[28],"than":[29],"conventional":[30],"solvers.":[31],"While":[32],"L2O":[33],"been":[35],"applied":[36],"various":[38],"problems,":[39],"crucial":[41],"yet":[42],"challenging":[43],"class":[44],"\u2014":[47,57,132,143],"robust":[48,74,97,117],"combinatorial":[49,75,98],"in":[51,78,119,179],"form":[53],"minimax":[55],"have":[58],"largely":[59],"remained":[60],"under-explored.":[61],"In":[62,92],"addition":[63],"exponentially":[66],"large":[67],"decision":[68],"space,":[69],"key":[71],"challenge":[72],"for":[73,109,134,140,161,174],"lies":[77],"inner":[80],"problem,":[82],"which":[83,113],"is":[84],"typically":[85],"non-convex":[86],"entangled":[88],"with":[89],"outer":[90],"optimization.":[91],"this":[93],"paper,":[94],"we":[95,171],"study":[96],"propose":[101],"novel":[103],"learning-based":[104,130],"optimizer,":[105],"called":[106],"LRCO":[107,125,187],"(Learning":[108],"Robust":[110],"Combinatorial":[111],"Optimization),":[112],"quickly":[114],"outputs":[115],"solution":[118],"presence":[121],"uncertain":[123],"context.":[124],"leverages":[126],"pair":[128],"optimizers":[131],"one":[133],"minimizer":[136],"other":[139],"maximizer":[142],"that":[144,186],"use":[145],"their":[146],"respective":[147],"objective":[148],"functions":[149],"losses":[151],"can":[153,188],"be":[154],"trained":[155],"without":[156],"need":[158],"labels":[160],"training":[162],"problem":[163,178],"instances.":[164],"To":[165],"evaluate":[166],"performance":[168],"LRCO,":[170],"perform":[172],"simulations":[173],"task":[176],"offloading":[177],"vehicular":[180],"edge":[181],"computing.":[182],"Our":[183],"results":[184],"highlight":[185],"greatly":[189],"reduce":[190],"worst-case":[192],"cost":[193],"improve":[195],"robustness,":[196],"while":[197],"having":[198],"very":[200],"low":[201],"complexity.":[203]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}