{"id":"https://openalex.org/W2002192291","doi":"https://doi.org/10.1007/s11590-013-0636-3","title":"Algorithm for quadratic semi-assignment problem with partition size coefficients","display_name":"Algorithm for quadratic semi-assignment problem with partition size coefficients","publication_year":2013,"publication_date":"2013-03-26","ids":{"openalex":"https://openalex.org/W2002192291","doi":"https://doi.org/10.1007/s11590-013-0636-3","mag":"2002192291"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-013-0636-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-013-0636-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-013-0636-3.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11590-013-0636-3.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038068703","display_name":"Maciej Drwal","orcid":"https://orcid.org/0000-0002-8999-8748"},"institutions":[{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I11923345","display_name":"Wroc\u0142aw University of Science and Technology","ror":"https://ror.org/008fyn775","country_code":"PL","type":"education","lineage":["https://openalex.org/I11923345"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Maciej Drwal","raw_affiliation_strings":["Institute of Computer Science, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370 , Wroclaw, Poland","Wroc\u0142aw University of Technology,"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370 , Wroclaw, Poland","institution_ids":["https://openalex.org/I11923345","https://openalex.org/I4210087266"]},{"raw_affiliation_string":"Wroc\u0142aw University of Technology,","institution_ids":["https://openalex.org/I11923345"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038068703"],"corresponding_institution_ids":["https://openalex.org/I11923345","https://openalex.org/I4210087266"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.131,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.80342305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"3","first_page":"1183","last_page":"1190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9883999824523926,"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/partition","display_name":"Partition (number theory)","score":0.7304503917694092},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6296396255493164},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.5651667714118958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5610424280166626},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5052581429481506},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4813728630542755},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4772215485572815},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.47183114290237427},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.43494218587875366},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4316520392894745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3994956612586975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.371412456035614},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36836445331573486},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.2241218090057373}],"concepts":[{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7304503917694092},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6296396255493164},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.5651667714118958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5610424280166626},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5052581429481506},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4813728630542755},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4772215485572815},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.47183114290237427},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.43494218587875366},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4316520392894745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3994956612586975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.371412456035614},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36836445331573486},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.2241218090057373},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11590-013-0636-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-013-0636-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-013-0636-3.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s11590-013-0636-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-013-0636-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-013-0636-3.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5374134968","display_name":null,"funder_award_id":"European Social Fund","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2002192291.pdf","grobid_xml":"https://content.openalex.org/works/W2002192291.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W3464401","https://openalex.org/W186403072","https://openalex.org/W964861289","https://openalex.org/W1486993561","https://openalex.org/W1526250527","https://openalex.org/W1852055750","https://openalex.org/W1985875030","https://openalex.org/W1989179252","https://openalex.org/W2009978643","https://openalex.org/W2019426691","https://openalex.org/W2078448419","https://openalex.org/W2171103562","https://openalex.org/W2340541605","https://openalex.org/W2576116471","https://openalex.org/W2808376720","https://openalex.org/W4211036892","https://openalex.org/W4253215513"],"related_works":["https://openalex.org/W2025912669","https://openalex.org/W2057299700","https://openalex.org/W1549987457","https://openalex.org/W2014615094","https://openalex.org/W1977789739","https://openalex.org/W2351778335","https://openalex.org/W4240458717","https://openalex.org/W2497180562","https://openalex.org/W2379495598","https://openalex.org/W2047470742"],"abstract_inverted_index":{"This":[0],"paper":[1],"discusses":[2],"the":[3,18,22,44,60,73],"problem":[4,54,82],"of":[5,9,24,31,34,41,43,46,62,65,67,75],"assigning":[6],"$$N$$":[7],"streams":[8],"requests":[10,35],"(clients)":[11],"to":[12,20],"$$M$$":[13,68,92],"related":[14],"server":[15],"machines":[16],"with":[17],"objective":[19],"minimize":[21],"sum":[23,40,61],"worst-case":[25],"processing":[26],"times.":[27],"The":[28],"completion":[29],"time":[30,88],"a":[32,39,50,76],"batch":[33],"is":[36],"measured":[37],"as":[38,58],"weights":[42,64],"subset":[45],"clients":[47],"which":[48],"share":[49],"single":[51],"machine.":[52],"Such":[53],"can":[55,83],"be":[56,84],"seen":[57],"minimizing":[59],"total":[63],"blocks":[66],"-partition,":[69],"each":[70],"multiplied":[71],"by":[72],"cardinality":[74],"block.":[77],"We":[78],"prove":[79],"that":[80],"this":[81],"solved":[85],"in":[86],"polynomial":[87],"for":[89],"any":[90],"fixed":[91],"and":[93],"present":[94],"an":[95],"efficient":[96],"backward":[97],"induction":[98],"algorithm.":[99]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}