{"id":"https://openalex.org/W3118404067","doi":"https://doi.org/10.1109/cdc42340.2020.9304435","title":"An under-approximation for the robust uncertain two-level cooperative set covering problem","display_name":"An under-approximation for the robust uncertain two-level cooperative set covering problem","publication_year":2020,"publication_date":"2020-12-14","ids":{"openalex":"https://openalex.org/W3118404067","doi":"https://doi.org/10.1109/cdc42340.2020.9304435","mag":"3118404067"},"language":"en","primary_location":{"id":"doi:10.1109/cdc42340.2020.9304435","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc42340.2020.9304435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 59th IEEE Conference on Decision and Control (CDC)","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/A5080589507","display_name":"Shuxin Ding","orcid":"https://orcid.org/0000-0002-7319-1878"},"institutions":[{"id":"https://openalex.org/I4210141966","display_name":"China Academy of Railway Sciences","ror":"https://ror.org/051wv2j09","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210141966"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuxin Ding","raw_affiliation_strings":["Signal and Communication Research Institute, China Academy of Railway Sciences Corporation Limited, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Signal and Communication Research Institute, China Academy of Railway Sciences Corporation Limited, Beijing, China","institution_ids":["https://openalex.org/I4210141966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100360233","display_name":"Qi Zhang","orcid":"https://orcid.org/0000-0001-8862-4675"},"institutions":[{"id":"https://openalex.org/I4210141966","display_name":"China Academy of Railway Sciences","ror":"https://ror.org/051wv2j09","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210141966"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qi Zhang","raw_affiliation_strings":["Signal and Communication Research Institute, China Academy of Railway Sciences Corporation Limited, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Signal and Communication Research Institute, China Academy of Railway Sciences Corporation Limited, Beijing, China","institution_ids":["https://openalex.org/I4210141966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101632782","display_name":"Zhiming Yuan","orcid":"https://orcid.org/0000-0002-3012-3656"},"institutions":[{"id":"https://openalex.org/I4210141966","display_name":"China Academy of Railway Sciences","ror":"https://ror.org/051wv2j09","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210141966"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhiming Yuan","raw_affiliation_strings":["Signal and Communication Research Institute, China Academy of Railway Sciences Corporation Limited, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Signal and Communication Research Institute, China Academy of Railway Sciences Corporation Limited, Beijing, China","institution_ids":["https://openalex.org/I4210141966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210141966"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.24288721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1152","last_page":"1157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9879999756813049,"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/set-cover-problem","display_name":"Set cover problem","score":0.757021427154541},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7478954792022705},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.7144712209701538},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6263331174850464},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6254043579101562},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6247447729110718},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6099530458450317},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5993880033493042},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.5784958600997925},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5492659211158752},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.529280960559845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3689384460449219},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11973461508750916},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0737922191619873}],"concepts":[{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.757021427154541},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7478954792022705},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7144712209701538},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6263331174850464},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6254043579101562},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6247447729110718},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6099530458450317},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5993880033493042},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.5784958600997925},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5492659211158752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.529280960559845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3689384460449219},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11973461508750916},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0737922191619873},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc42340.2020.9304435","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc42340.2020.9304435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 59th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W58481735","https://openalex.org/W358058755","https://openalex.org/W1972280695","https://openalex.org/W1990275757","https://openalex.org/W2006601554","https://openalex.org/W2064453600","https://openalex.org/W2118578357","https://openalex.org/W2133676848","https://openalex.org/W2156206831","https://openalex.org/W2157054705","https://openalex.org/W2163196406","https://openalex.org/W2364054291","https://openalex.org/W2608348709","https://openalex.org/W2783738786","https://openalex.org/W2964055038","https://openalex.org/W2968608096","https://openalex.org/W7071663081"],"related_works":["https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2147086810","https://openalex.org/W1496354680","https://openalex.org/W4244934433","https://openalex.org/W1502438505","https://openalex.org/W2952847377","https://openalex.org/W2970112606","https://openalex.org/W1629104677"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"the":[3,40,49,64,69,89,105,114,125,140,151],"robust":[4,77],"uncertain":[5],"two-level":[6],"cooperative":[7,55],"set":[8],"covering":[9,56],"problem":[10,24],"(RUTLCSCP).":[11],"Given":[12],"two":[13],"types":[14,32,136],"of":[15,30,51,68,80,88,142],"facilities,":[16],"which":[17,28,71,137],"are":[18,157],"called":[19],"y-facility":[20],"and":[21,54,91],"zfacility.":[22],"The":[23],"is":[25,72,83],"to":[26,33,38,159],"decide":[27],"facilities":[29],"both":[31],"be":[34,93,113,145,160],"selected,":[35],"in":[36,127,132,154],"order":[37],"cover":[39],"demand":[41],"nodes":[42],"cooperatively":[43],"with":[44,134],"minimal":[45],"cost.":[46],"It":[47],"combines":[48],"concepts":[50],"robust,":[52],"probabilistic,":[53],"by":[57,85],"introducting":[58],"\"\u0393-robust":[59],"two-level-cooperative":[60],"\u03b1-cover\"":[61],"constraints.":[62],"Additionally,":[63],"constraint":[65],"relaxed":[66],"version":[67,79],"RUTLCSCP,":[70,143],"also":[73,112],"a":[74,96],"linear":[75,86,99],"approximation":[76,87],"counterpart":[78],"RUTLCSCP":[81,117],"(RUTLCSCP-LA-RC),":[82],"developed":[84],"constraints,":[90],"can":[92,111,144],"stated":[94],"as":[95],"compact":[97],"mixed-integer":[98],"programming":[100],"problem.":[101],"We":[102],"show":[103,123],"that":[104,124],"solution":[106,115],"for":[107,116],"RUTLCSCP-LA-RC,":[108],"\u03b5-under-approximate":[109],"solution,":[110],"on":[118],"some":[119],"conditions.":[120],"Computational":[121],"experiments":[122],"solutions":[126,153],"333":[128],"instances":[129,131,156],"(10125":[130],"total)":[133],"12":[135],"tinily":[138],"violate":[139],"constraints":[141],"an":[146],"efficient":[147],"under-approximate":[148],"solutions,":[149],"while":[150],"feasible":[152],"other":[155],"proven":[158],"optimal.":[161]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}