{"id":"https://openalex.org/W4220793157","doi":"https://doi.org/10.1080/03155986.2022.2049567","title":"An exact algorithm for large knapsack sharing problems","display_name":"An exact algorithm for large knapsack sharing problems","publication_year":2022,"publication_date":"2022-03-21","ids":{"openalex":"https://openalex.org/W4220793157","doi":"https://doi.org/10.1080/03155986.2022.2049567"},"language":"en","primary_location":{"id":"doi:10.1080/03155986.2022.2049567","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03155986.2022.2049567","pdf_url":null,"source":{"id":"https://openalex.org/S155959304","display_name":"INFOR Information Systems and Operational Research","issn_l":"0315-5986","issn":["0315-5986","1916-0615"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFOR: Information Systems and Operational Research","raw_type":"journal-article"},"type":"article","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/A5085061623","display_name":"Yacine Laalaoui","orcid":"https://orcid.org/0000-0002-4213-6403"},"institutions":[{"id":"https://openalex.org/I179331831","display_name":"Taif University","ror":"https://ror.org/014g1a453","country_code":"SA","type":"education","lineage":["https://openalex.org/I179331831"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Yacine Laalaoui","raw_affiliation_strings":["Department of Information Technology, College of Computers & Information Technology, Taif University, Taif, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, College of Computers & Information Technology, Taif University, Taif, Saudi Arabia","institution_ids":["https://openalex.org/I179331831"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066348607","display_name":"Hedi Mhalla","orcid":"https://orcid.org/0000-0001-7434-8956"},"institutions":[{"id":"https://openalex.org/I2803079837","display_name":"American University of the Middle East","ror":"https://ror.org/02gqgne03","country_code":"KW","type":"education","lineage":["https://openalex.org/I2803079837"]}],"countries":["KW"],"is_corresponding":true,"raw_author_name":"Hedi Mhalla","raw_affiliation_strings":["College of Engineering and Technology, American University of the Middle East, Kuwait"],"affiliations":[{"raw_affiliation_string":"College of Engineering and Technology, American University of the Middle East, Kuwait","institution_ids":["https://openalex.org/I2803079837"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066348607"],"corresponding_institution_ids":["https://openalex.org/I2803079837"],"apc_list":null,"apc_paid":null,"fwci":0.2668,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59216598,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"60","issue":"3","first_page":"315","last_page":"341"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9983000159263611,"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/T12288","display_name":"Optimization and Search Problems","score":0.991100013256073,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9385031461715698},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5494734644889832},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4454852342605591}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9385031461715698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5494734644889832},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4454852342605591}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/03155986.2022.2049567","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03155986.2022.2049567","pdf_url":null,"source":{"id":"https://openalex.org/S155959304","display_name":"INFOR Information Systems and Operational Research","issn_l":"0315-5986","issn":["0315-5986","1916-0615"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFOR: Information Systems and Operational Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1589917387","https://openalex.org/W1966693694","https://openalex.org/W1972746086","https://openalex.org/W2015348119","https://openalex.org/W2029256120","https://openalex.org/W2043570581","https://openalex.org/W2045768377","https://openalex.org/W2127172809","https://openalex.org/W2150560290","https://openalex.org/W2155921933","https://openalex.org/W2215472514","https://openalex.org/W2256182704","https://openalex.org/W2547604708","https://openalex.org/W2734772720"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1521824362","https://openalex.org/W3177799343","https://openalex.org/W3119198325","https://openalex.org/W623642078"],"abstract_inverted_index":{"The":[0,40,93,114],"Knapsack":[1,46],"Sharing":[2],"Problem":[3,47],"(KSP)":[4],"is":[5,32,177],"the":[6,25,29,36,44,80,119,127,134,139,146,155,174],"problem":[7,42,82],"of":[8,12,28,103,121,129,136],"assigning":[9],"a":[10,20,65,101],"subset":[11],"n":[13],"items":[14,187],"from":[15,154],"m":[16],"disjoint":[17],"classes":[18,190],"to":[19,35,72,106,132,138,143,179,185],"shared":[21],"knapsack":[22,37,75],"such":[23],"that":[24,165],"total":[26],"profit":[27],"smallest":[30],"class":[31,131],"maximized":[33],"subject":[34],"capacity":[38],"constraint.":[39],"KSP":[41,81,98],"generalizes":[43],"0/1":[45],"(KP),":[48],"and":[49,56,85,142,188],"it":[50],"has":[51],"wide":[52],"applications":[53],"in":[54,196],"finance":[55],"resource":[57],"allocation":[58],"domains.":[59],"In":[60],"this":[61],"article,":[62],"we":[63],"describe":[64],"new":[66,175],"Dichotomous-based":[67,91],"exact":[68,111,171],"algorithm,":[69],"called":[70],"Sharknap,":[71],"solve":[73,180],"large":[74,181],"sharing":[76],"problems.":[77],"Sharknap":[78,166],"solves":[79],"by":[83],"decomposition":[84,94],"dichotomous":[86,115],"reduction":[87,116],"like":[88],"all":[89,169],"existing":[90,170],"algorithms.":[92,172],"phase":[95,117],"splits":[96],"each":[97,122],"instance":[99],"into":[100],"series":[102],"KP":[104,112,140],"problems":[105],"be":[107],"solved":[108],"using":[109],"an":[110],"solver.":[113],"reduces":[118],"weight":[120],"considered":[123],"class.":[124],"We":[125],"introduce":[126],"concept":[128],"critical":[130],"bound":[133],"number":[135],"calls":[137],"solver":[141],"speed":[144],"up":[145,184],"search":[147],"algorithm.":[148],"Experimental":[149],"results":[150],"on":[151,160],"standard":[152],"benchmarks":[153],"literature":[156],"as":[157,159],"well":[158],"randomly":[161],"generated":[162],"instances":[163,182],"show":[164],"significantly":[167],"outperforms":[168],"Interestingly,":[173],"algorithm":[176],"able":[178],"with":[183],"100000":[186],"1000":[189],"within":[191],"less":[192],"than":[193],"one":[194],"second":[195],"many":[197],"times.":[198]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}