{"id":"https://openalex.org/W6910713153","doi":"https://doi.org/10.48550/arxiv.2504.07663","title":"Multiplicative assignment with upgrades","display_name":"Multiplicative assignment with upgrades","publication_year":2025,"publication_date":"2025-04-10","ids":{"openalex":"https://openalex.org/W6910713153","doi":"https://doi.org/10.48550/arxiv.2504.07663"},"language":"en","primary_location":{"id":"doi:10.48550/arxiv.2504.07663","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.07663","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2504.07663","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Armbruster, Alexander","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Armbruster, Alexander","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Rohwedder, Lars","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rohwedder, Lars","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Weltge, Stefan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weltge, Stefan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Wiese, Andreas","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wiese, Andreas","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Zhang, Ruilong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Ruilong","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"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":true,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4641000032424927,"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.4641000032424927,"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/T12288","display_name":"Optimization and Search Problems","score":0.15649999678134918,"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"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.08760000020265579,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8306999802589417},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.651199996471405},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5564000010490417},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.503600001335144},{"id":"https://openalex.org/keywords/upgrade","display_name":"Upgrade","score":0.498199999332428},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4887000024318695},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4787999987602234},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4361000061035156},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.40700000524520874},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3955000042915344}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8306999802589417},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.651199996471405},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6366000175476074},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5564000010490417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5138000249862671},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.503600001335144},{"id":"https://openalex.org/C2780615140","wikidata":"https://www.wikidata.org/wiki/Q920419","display_name":"Upgrade","level":2,"score":0.498199999332428},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4887000024318695},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4787999987602234},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4361000061035156},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.40700000524520874},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3955000042915344},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.3781000077724457},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.37619999051094055},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36059999465942383},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3596999943256378},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.35929998755455017},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.35370001196861267},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3474999964237213},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3416999876499176},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3416000008583069},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3012000024318695},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.29580000042915344},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.2847000062465668},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.2818000018596649},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2590999901294708},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2504.07663","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.07663","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2504.07663","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.07663","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.44794467091560364,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"a":[2,18,62,76,82,88,139,153,179,184,204],"problem":[3,13,54,132,197,224],"related":[4,232],"to":[5,71,75,99,107,114,120,133,159,173,177,194,225,236,249,252],"submodular":[6,180],"function":[7,182],"optimization":[8],"and":[9,66,68,84,90,113],"the":[10,51,100,122,131,143,165,171,219,223],"exact":[11,166,216],"matching":[12,137,167],"for":[14,94,209,218],"which":[15,39,58],"we":[16,40,49,59,69,147,201,214,245],"show":[17],"rather":[19],"peculiar":[20],"status:":[21],"its":[22],"natural":[23],"LP-relaxation":[24],"can":[25,41,127],"have":[26],"fractional":[27],"optimal":[28,36,136],"vertices,":[29],"but":[30],"there":[31],"is":[32,106],"always":[33],"also":[34,42,203],"an":[35,91,116,135,190,212],"integral":[37],"vertex,":[38],"compute":[43,115,134],"in":[44,57,118,138,164,234],"polynomial":[45],"time.":[46],"More":[47],"specifically,":[48],"consider":[50],"multiplicative":[52],"assignment":[53,117],"with":[55,142],"upgrades":[56],"are":[60],"given":[61],"set":[63,181],"of":[64,156,222,240],"customers":[65],"suppliers":[67,112,172],"seek":[70],"assign":[72],"each":[73,85,95],"customer":[74,80],"different":[77],"supplier.":[78],"Each":[79],"has":[81,87],"demand":[83,97],"supplier":[86],"regular":[89],"upgraded":[92,175],"cost":[93],"unit":[96],"provided":[98],"respective":[101,255],"assigned":[102],"client.":[103],"Our":[104,187],"goal":[105],"upgrade":[108,247],"at":[109],"most":[110],"$k$":[111,150,161,250],"order":[119,235],"minimize":[121,237],"total":[123],"resulting":[124],"cost.":[125],"This":[126],"be":[128,174],"cast":[129],"as":[130],"bipartite":[140],"graph":[141],"additional":[144],"constraint":[145],"that":[146],"must":[148],"select":[149],"edges":[151,163],"from":[152],"certain":[154],"group":[155],"edges,":[157],"similar":[158],"selecting":[160,170],"red":[162],"problem.":[168],"Also,":[169],"corresponds":[176],"maximizing":[178],"under":[183],"cardinality":[185],"constraint.":[186],"result":[188],"yields":[189],"efficient":[191],"LP-based":[192],"algorithm":[193,208],"solve":[195],"our":[196],"optimally.":[198],"In":[199],"addition,":[200],"provide":[202],"purely":[205],"strongly":[206],"polynomial-time":[207],"it.":[210],"As":[211],"application,":[213],"obtain":[215],"algorithms":[217],"upgrading":[220],"variant":[221],"schedule":[226],"jobs":[227,251],"on":[228],"identical":[229],"or":[230],"uniformly":[231],"machines":[233],"their":[238,254],"sum":[239],"completion":[241],"times,":[242],"i.e.,":[243],"where":[244],"may":[246],"up":[248],"reduce":[253],"processing":[256],"times.":[257]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}