{"id":"https://openalex.org/W4392505058","doi":"https://doi.org/10.1016/j.orl.2024.107104","title":"On upper bounds for the multiple knapsack assignment problem","display_name":"On upper bounds for the multiple knapsack assignment problem","publication_year":2024,"publication_date":"2024-03-06","ids":{"openalex":"https://openalex.org/W4392505058","doi":"https://doi.org/10.1016/j.orl.2024.107104"},"language":"en","primary_location":{"id":"doi:10.1016/j.orl.2024.107104","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.orl.2024.107104","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.orl.2024.107104","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043357839","display_name":"Laura Galli","orcid":"https://orcid.org/0000-0002-5801-9439"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Laura Galli","raw_affiliation_strings":["Department of Computer Science, University of Pisa, Largo B. Pontecorvo 3, 56127 Pisa, Italy"],"raw_orcid":"https://orcid.org/0000-0002-5801-9439","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Pisa, Largo B. Pontecorvo 3, 56127 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004954937","display_name":"Adam N. Letchford","orcid":"https://orcid.org/0000-0002-3191-5006"},"institutions":[{"id":"https://openalex.org/I67415387","display_name":"Lancaster University","ror":"https://ror.org/04f2nsd36","country_code":"GB","type":"education","lineage":["https://openalex.org/I67415387"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Adam N. Letchford","raw_affiliation_strings":["Department of Management Science, Lancaster University, Lancaster LA1 4YW, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-3191-5006","affiliations":[{"raw_affiliation_string":"Department of Management Science, Lancaster University, Lancaster LA1 4YW, United Kingdom","institution_ids":["https://openalex.org/I67415387"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004954937","https://openalex.org/A5043357839"],"corresponding_institution_ids":["https://openalex.org/I108290504","https://openalex.org/I67415387"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":{"value":2760,"currency":"USD","value_usd":2760},"fwci":0.4352,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60279994,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"54","issue":null,"first_page":"107104","last_page":"107104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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.9993000030517578,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9955000281333923,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9952999949455261,"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.8815704584121704},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4906379282474518},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4769791066646576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43514448404312134},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4216594994068146},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.4146210551261902},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.41349244117736816},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4112284183502197},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4034169912338257},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.28016456961631775}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8815704584121704},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4906379282474518},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4769791066646576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43514448404312134},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4216594994068146},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.4146210551261902},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.41349244117736816},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4112284183502197},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4034169912338257},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.28016456961631775},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/j.orl.2024.107104","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.orl.2024.107104","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"},{"id":"pmh:oai:arpi.unipi.it:11568/1240707","is_oa":false,"landing_page_url":"https://hdl.handle.net/11568/1240707","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:cris.unibo.it:11585/983161","is_oa":true,"landing_page_url":"https://www.sciencedirect.com/science/article/pii/S0167637724000403","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/j.orl.2024.107104","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.orl.2024.107104","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W254944847","https://openalex.org/W1966693694","https://openalex.org/W1999244290","https://openalex.org/W2012335003","https://openalex.org/W2017316844","https://openalex.org/W2094913290","https://openalex.org/W2519940434","https://openalex.org/W2901122828","https://openalex.org/W6628094634"],"related_works":["https://openalex.org/W1985289934","https://openalex.org/W2084616826","https://openalex.org/W2357355816","https://openalex.org/W1965789645","https://openalex.org/W2993365626","https://openalex.org/W2008600006","https://openalex.org/W2412614002","https://openalex.org/W2889442766","https://openalex.org/W1968202374","https://openalex.org/W2087209118"],"abstract_inverted_index":{"The":[0],"Multiple":[1],"Knapsack":[2],"Assignment":[3],"Problem":[4],"is":[5,69],"a":[6,71],"strongly":[7],"NP-hard":[8],"combinatorial":[9],"optimisation":[10],"problem,":[11,23],"with":[12],"several":[13],"applications.":[14],"We":[15,35],"show":[16,37],"that":[17,38],"an":[18,53],"upper":[19],"bound":[20],"for":[21],"the":[22,47,65,74],"due":[24,41],"to":[25,42,60],"Kataoka":[26],"and":[27,44],"Yamada,":[28],"can":[29],"be":[30,61],"computed":[31],"in":[32],"linear":[33],"time.":[34],"then":[36],"some":[39],"bounds":[40],"Martello":[43],"Monaci":[45],"dominate":[46],"Kataoka-Yamada":[48],"bound.":[49],"Finally,":[50],"we":[51],"define":[52],"even":[54],"stronger":[55],"bound,":[56],"which":[57],"turns":[58],"out":[59],"particularly":[62],"effective":[63],"when":[64],"number":[66,75],"of":[67,73,76],"knapsacks":[68],"not":[70],"multiple":[72],"item":[77],"classes.":[78]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2024-03-07T00:00:00"}