{"id":"https://openalex.org/W4387171291","doi":"https://doi.org/10.3233/faia230594","title":"Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties","display_name":"Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties","publication_year":2023,"publication_date":"2023-09-28","ids":{"openalex":"https://openalex.org/W4387171291","doi":"https://doi.org/10.3233/faia230594"},"language":"en","primary_location":{"id":"doi:10.3233/faia230594","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia230594","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA230594","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA230594","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050496086","display_name":"Xiankun Yan","orcid":"https://orcid.org/0000-0002-2309-8034"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xiankun Yan","raw_affiliation_strings":["Optimisation and Logistics, University of Adelaide, Adelaide, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043146473","display_name":"Anh Viet","orcid":"https://orcid.org/0000-0003-3850-1671"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Anh Viet Do","raw_affiliation_strings":["Optimisation and Logistics, University of Adelaide, Adelaide, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068244151","display_name":"Feng Shi","orcid":"https://orcid.org/0000-0002-1415-0515"},"institutions":[{"id":"https://openalex.org/I139660479","display_name":"Central South University","ror":"https://ror.org/00f1zfq44","country_code":"CN","type":"education","lineage":["https://openalex.org/I139660479"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Feng Shi","raw_affiliation_strings":["School of Computer Science and Engineering, Central South University, Changsha, P.R. China","Xiangjiang Laboratory, Changsha, P.R. China","School of Computer Science and Engineering, Central South University, Changsha, P.R. China; Xiangjiang Laboratory, Changsha, P.R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Central South University, Changsha, P.R. China","institution_ids":["https://openalex.org/I139660479"]},{"raw_affiliation_string":"Xiangjiang Laboratory, Changsha, P.R. China","institution_ids":[]},{"raw_affiliation_string":"School of Computer Science and Engineering, Central South University, Changsha, P.R. China; Xiangjiang Laboratory, Changsha, P.R. China","institution_ids":["https://openalex.org/I139660479"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018252335","display_name":"Xiaoyu Qin","orcid":"https://orcid.org/0000-0002-9720-3220"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Xiaoyu Qin","raw_affiliation_strings":["University of Birmingham, Birmingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Birmingham, Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Optimisation and Logistics, University of Adelaide, Adelaide, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1349,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.88650111,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.862500011920929,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.862500011920929,"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/T11182","display_name":"Auction Theory and Applications","score":0.836899995803833,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8004999756813049,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/submodular-set-function","display_name":"Submodular set function","score":0.9195399284362793},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7821682691574097},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.722674548625946},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.56122887134552},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.551947832107544},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.5355365872383118},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5263622403144836},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5096697807312012},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.49267131090164185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49259811639785767},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.4640246033668518},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.44674739241600037},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.44507843255996704},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.44462648034095764},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36130666732788086}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9195399284362793},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7821682691574097},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.722674548625946},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.56122887134552},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.551947832107544},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.5355365872383118},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5263622403144836},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5096697807312012},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.49267131090164185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49259811639785767},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.4640246033668518},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.44674739241600037},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.44507843255996704},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.44462648034095764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36130666732788086},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/faia230594","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia230594","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA230594","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.3233/faia230594","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia230594","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA230594","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4754930803","display_name":null,"funder_award_id":"2021JJ40791","funder_id":"https://openalex.org/F4320322843","funder_display_name":"Natural Science Foundation of\u00a0Hunan Province"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320322843","display_name":"Natural Science Foundation of\u00a0Hunan Province","ror":null}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4387171291.pdf"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1875482710","https://openalex.org/W1982141993","https://openalex.org/W2049606892","https://openalex.org/W2059598290","https://openalex.org/W2061820396","https://openalex.org/W2080379754","https://openalex.org/W2083350518","https://openalex.org/W2141403143","https://openalex.org/W2155461593","https://openalex.org/W2294347342","https://openalex.org/W2500139799","https://openalex.org/W2531699011","https://openalex.org/W2740307401","https://openalex.org/W2752743454","https://openalex.org/W2901129691","https://openalex.org/W2901802524","https://openalex.org/W2911575524","https://openalex.org/W2962827889","https://openalex.org/W2963481228","https://openalex.org/W2963819174","https://openalex.org/W2969604833","https://openalex.org/W2979681468","https://openalex.org/W2991449089","https://openalex.org/W2997872002","https://openalex.org/W3016148837","https://openalex.org/W3035922393","https://openalex.org/W3040314049","https://openalex.org/W3091447387","https://openalex.org/W3128149822","https://openalex.org/W3173282450","https://openalex.org/W3200825350","https://openalex.org/W4232212779","https://openalex.org/W4285604467","https://openalex.org/W4286978212","https://openalex.org/W4291418325"],"related_works":["https://openalex.org/W2357796514","https://openalex.org/W2393014972","https://openalex.org/W2357595179","https://openalex.org/W2351136238","https://openalex.org/W2402949237","https://openalex.org/W2891162720","https://openalex.org/W2964314169","https://openalex.org/W2169800510","https://openalex.org/W2594118609","https://openalex.org/W2968699064"],"abstract_inverted_index":{"Chance":[0],"constraints":[1,18,47],"are":[2,53,66],"frequently":[3],"used":[4],"to":[5,71,130],"limit":[6],"the":[7,17,49,54,72,88,96,104,109,131,136,140,145,154,159],"probability":[8],"of":[9,33,90,106,153],"constraint":[10],"violations":[11],"in":[12,48,76,87],"real-world":[13,77],"optimization":[14,26,34],"problems":[15,35,43],"where":[16,51,103],"involve":[19],"stochastic":[20,37,45,74],"components.":[21],"We":[22,115],"study":[23],"chance-constrained":[24,151],"submodular":[25,42,91],"problems,":[27],"which":[28],"capture":[29],"a":[30,122,126],"wide":[31],"range":[32],"with":[36,44,69],"constraints.":[38],"Previous":[39],"studies":[40],"considered":[41],"knapsack":[46],"case":[50],"uncertainties":[52],"same":[55,110],"for":[56,82,100],"each":[57],"item":[58],"that":[59,119,144],"can":[60,120],"be":[61],"selected.":[62],"However,":[63],"uncertainty":[64],"levels":[65],"usually":[67],"variable":[68],"respect":[70],"different":[73,113],"components":[75],"scenarios,":[78],"and":[79,158],"rigorous":[80],"analysis":[81,99],"this":[83,101],"setting":[84],"is":[85],"missing":[86],"context":[89],"optimization.":[92],"This":[93],"paper":[94],"provides":[95],"first":[97],"such":[98],"case,":[102],"weights":[105],"items":[107],"have":[108],"expectation":[111],"but":[112],"dispersion.":[114],"present":[116],"greedy":[117],"algorithms":[118,146],"obtain":[121],"high-quality":[123],"solution,":[124],"i.e.,":[125],"constant":[127],"approximation":[128],"ratio":[129],"given":[132],"optimal":[133],"solution":[134],"from":[135],"deterministic":[137],"setting.":[138],"In":[139],"experiments,":[141],"we":[142],"demonstrate":[143],"perform":[147],"effectively":[148],"on":[149],"several":[150],"instances":[152],"maximum":[155],"coverage":[156],"problem":[157],"influence":[160],"maximization":[161],"problem.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}