{"id":"https://openalex.org/W7154747177","doi":"https://doi.org/10.48550/arxiv.2604.15068","title":"Analysis of Multitasking Pareto Optimization for Monotone Submodular Problems","display_name":"Analysis of Multitasking Pareto Optimization for Monotone Submodular Problems","publication_year":2026,"publication_date":"2026-04-16","ids":{"openalex":"https://openalex.org/W7154747177","doi":"https://doi.org/10.48550/arxiv.2604.15068"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.15068","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15068","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.15068","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5118856146","display_name":"Liam Wigney","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wigney, Liam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133914857","display_name":"Frank Neumann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neumann, Frank","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5031999945640564,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5031999945640564,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.2727999985218048,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.046300001442432404,"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/human-multitasking","display_name":"Human multitasking","score":0.8618000149726868},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8300999999046326},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6535999774932861},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.6517000198364258},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5924999713897705},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.45579999685287476},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4104999899864197}],"concepts":[{"id":"https://openalex.org/C107418235","wikidata":"https://www.wikidata.org/wiki/Q1520565","display_name":"Human multitasking","level":2,"score":0.8618000149726868},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8300999999046326},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7336999773979187},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6535999774932861},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6517000198364258},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5924999713897705},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.45579999685287476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4480000138282776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41280001401901245},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4104999899864197},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.40619999170303345},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4000999927520752},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.3492000102996826},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.30399999022483826},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.29120001196861267},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.2775999903678894},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.263700008392334}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.15068","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15068","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.15068","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15068","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Pareto":[0,89],"optimization":[1],"via":[2],"evolutionary":[3],"multi-objective":[4],"algorithms":[5],"has":[6],"been":[7],"shown":[8],"to":[9,41,95,102,106],"efficiently":[10],"solve":[11,42],"constrained":[12],"monotone":[13,58],"submodular":[14,59],"functions.":[15],"Traditionally":[16],"when":[17],"solving":[18],"multiple":[19,43],"problems,":[20],"the":[21,53,69,77,93,118,122,132,139,147,151],"algorithm":[22],"is":[23],"run":[24],"for":[25,129,138,159],"each":[26,130],"problem":[27,142],"separately.":[28],"We":[29,67],"introduce":[30],"multitasking":[31,84,124],"formulations":[32,85],"of":[33,131],"these":[34],"problems":[35,45,55,100,160],"that":[36,82],"are":[37],"an":[38],"effective":[39],"way":[40],"related":[44],"with":[46],"a":[47,57,74,127,164],"single":[48],"run.":[49],"In":[50],"our":[51,83],"setting":[52],"given":[54,133],"share":[56,96],"function":[60],"$f$":[61],"but":[62],"have":[63,76,167],"different":[64],"knapsack":[65],"constraints.":[66],"examine":[68],"case":[70],"where":[71,161],"elements":[72,162],"within":[73,163],"constraint":[75,165],"same":[78],"cost":[79],"and":[80,154],"show":[81],"result":[86],"in":[87,157],"small":[88],"fronts.":[90],"This":[91],"allows":[92],"population":[94],"solutions":[97],"between":[98],"all":[99],"leading":[101],"significant":[103],"improvements":[104],"compared":[105],"running":[107],"several":[108],"classical":[109],"approaches":[110,125],"independently.":[111],"Using":[112],"rigorous":[113],"runtime":[114],"analysis,":[115],"we":[116],"analyze":[117],"expected":[119],"time":[120],"until":[121],"introduced":[123],"obtain":[126],"$(1-1/e)$-approximation":[128],"problems.":[134],"Our":[135],"experimental":[136],"investigations":[137],"maximum":[140],"coverage":[141],"give":[143],"further":[144],"insight":[145],"into":[146],"dynamics":[148],"behind":[149],"how":[150],"approach":[152],"works":[153],"doesn't":[155],"work":[156],"practice":[158],"also":[166],"varied":[168],"costs.":[169]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-18T00:00:00"}