{"id":"https://openalex.org/W3173282450","doi":"https://doi.org/10.1145/3449639.3459381","title":"Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights","display_name":"Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights","publication_year":2021,"publication_date":"2021-06-21","ids":{"openalex":"https://openalex.org/W3173282450","doi":"https://doi.org/10.1145/3449639.3459381","mag":"3173282450"},"language":"en","primary_location":{"id":"doi:10.1145/3449639.3459381","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3449639.3459381","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5078573149","display_name":"Yue Xie","orcid":"https://orcid.org/0000-0002-7959-4563"},"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":"Yue Xie","raw_affiliation_strings":["The University of Adelaide, Adelaide, SA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001757263","display_name":"Aneta Neumann","orcid":"https://orcid.org/0000-0002-0036-4782"},"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":"Aneta Neumann","raw_affiliation_strings":["The University of Adelaide, Adelaide, SA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","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":["The University of Adelaide, Adelaide, SA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004695687","display_name":"Andrew M. Sutton","orcid":"https://orcid.org/0000-0003-1295-6715"},"institutions":[{"id":"https://openalex.org/I4210115145","display_name":"University of Minnesota, Duluth","ror":"https://ror.org/01hy4qx27","country_code":"US","type":"education","lineage":["https://openalex.org/I4210115145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew M. Sutton","raw_affiliation_strings":["University of Minnesota Duluth"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Minnesota Duluth","institution_ids":["https://openalex.org/I4210115145"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1187","last_page":"1194"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9973000288009644,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9900418519973755},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6272256970405579},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6222378611564636},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48914578557014465},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4743843376636505},{"id":"https://openalex.org/keywords/profit","display_name":"Profit (economics)","score":0.44308948516845703},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.42958009243011475},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4258817732334137},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3671317994594574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3383219838142395}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9900418519973755},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6272256970405579},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6222378611564636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48914578557014465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4743843376636505},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.44308948516845703},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.42958009243011475},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4258817732334137},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3671317994594574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3383219838142395},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3449639.3459381","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3449639.3459381","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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":"Proceedings of the Genetic and Evolutionary Computation Conference","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":24,"referenced_works":["https://openalex.org/W1553838525","https://openalex.org/W1605768620","https://openalex.org/W1632066424","https://openalex.org/W1843453084","https://openalex.org/W1981776996","https://openalex.org/W1982141993","https://openalex.org/W1987213726","https://openalex.org/W2017373162","https://openalex.org/W2032499907","https://openalex.org/W2049606892","https://openalex.org/W2067971429","https://openalex.org/W2074197819","https://openalex.org/W2117156423","https://openalex.org/W2165220807","https://openalex.org/W2555395830","https://openalex.org/W2560124257","https://openalex.org/W2766995857","https://openalex.org/W2801538605","https://openalex.org/W2809877335","https://openalex.org/W2811220708","https://openalex.org/W2902373622","https://openalex.org/W2962827889","https://openalex.org/W3040314049","https://openalex.org/W3103982436"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2381035939","https://openalex.org/W2122137596","https://openalex.org/W2089402478","https://openalex.org/W2087209118","https://openalex.org/W2747091309","https://openalex.org/W2412614002","https://openalex.org/W780986551","https://openalex.org/W2005493932","https://openalex.org/W2994461947"],"abstract_inverted_index":{"Addressing":[0],"a":[1,7,36,42,64],"complex":[2],"real-world":[3],"optimization":[4],"problem":[5,13,51],"is":[6],"challenging":[8],"task.":[9],"The":[10],"chance-constrained":[11,49,126],"knapsack":[12,50],"with":[14,52],"correlated":[15,53],"uniform":[16,54,82],"weights":[17],"plays":[18],"an":[19,93],"important":[20],"role":[21],"in":[22,88,124],"the":[23,48,70,73,86,101,109,113,118,125],"case":[24],"where":[25],"dependent":[26],"stochastic":[27],"components":[28],"are":[29],"considered.":[30],"We":[31,56,97],"perform":[32],"runtime":[33,119],"analysis":[34],"of":[35,72,103,121],"randomized":[37],"search":[38],"algorithm":[39,45],"(RSA)":[40],"and":[41,75,85,106,112],"basic":[43],"evolutionary":[44],"(EA)":[46],"for":[47,59,62],"weights.":[55],"prove":[57],"bounds":[58],"both":[60,122],"algorithms":[61,74,123],"producing":[63],"feasible":[65],"solution.":[66],"Furthermore,":[67],"we":[68],"investigate":[69],"behaviour":[71],"carry":[76],"out":[77],"analyses":[78],"on":[79],"two":[80],"settings:":[81],"profit":[83,95,115],"value":[84],"setting":[87],"which":[89],"every":[90],"group":[91],"shares":[92],"arbitrary":[94],"profile.":[96],"provide":[98],"insight":[99],"into":[100],"structure":[102],"these":[104],"problems":[105],"show":[107],"how":[108],"weight":[110],"correlations":[111],"different":[114],"profiles":[116],"influence":[117],"behavior":[120],"setting.":[127]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}