{"id":"https://openalex.org/W2547604708","doi":"https://doi.org/10.1080/10556788.2016.1240795","title":"An exact constructive algorithm for the knapsack sharing problem","display_name":"An exact constructive algorithm for the knapsack sharing problem","publication_year":2016,"publication_date":"2016-11-02","ids":{"openalex":"https://openalex.org/W2547604708","doi":"https://doi.org/10.1080/10556788.2016.1240795","mag":"2547604708"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2016.1240795","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1240795","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"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":"Optimization Methods and Software","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/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"]},{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR","KW"],"is_corresponding":true,"raw_author_name":"Hedi Mhalla","raw_affiliation_strings":["Department of Mathematics and Statistics, American University of the Middle East, Egaila 15453, Kuwait","U.R EP-ROAD, Universite de Picardie Jules Verne, Amiens 80025, France"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, American University of the Middle East, Egaila 15453, Kuwait","institution_ids":["https://openalex.org/I2803079837"]},{"raw_affiliation_string":"U.R EP-ROAD, Universite de Picardie Jules Verne, Amiens 80025, France","institution_ids":["https://openalex.org/I4647051"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066348607"],"corresponding_institution_ids":["https://openalex.org/I2803079837","https://openalex.org/I4647051"],"apc_list":null,"apc_paid":null,"fwci":0.4233,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.71852587,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"32","issue":"5","first_page":"1078","last_page":"1094"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9994999766349792,"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.9994999766349792,"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.9711999893188477,"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.9696000218391418,"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.9454190731048584},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.7513364553451538},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4737734794616699},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.46873053908348083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42595988512039185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3632490634918213},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3433346450328827}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9454190731048584},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.7513364553451538},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4737734794616699},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.46873053908348083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42595988512039185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3632490634918213},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3433346450328827},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556788.2016.1240795","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1240795","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"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":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03619534v1","is_oa":false,"landing_page_url":"https://u-picardie.hal.science/hal-03619534","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Optimization Methods and Software, 2017, 32 (5), pp.1078-1094. ⟨10.1080/10556788.2016.1240795⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1492845317","https://openalex.org/W1589917387","https://openalex.org/W1965011664","https://openalex.org/W1972746086","https://openalex.org/W2001921343","https://openalex.org/W2014181360","https://openalex.org/W2015348119","https://openalex.org/W2022388909","https://openalex.org/W2029256120","https://openalex.org/W2043570581","https://openalex.org/W2045492613","https://openalex.org/W2045768377","https://openalex.org/W2057093282","https://openalex.org/W2070437690","https://openalex.org/W2090604111","https://openalex.org/W2093939346","https://openalex.org/W2094859983","https://openalex.org/W2130350796","https://openalex.org/W2150560290","https://openalex.org/W2155921933","https://openalex.org/W2179575170","https://openalex.org/W2227244727","https://openalex.org/W2293262914"],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2005493932","https://openalex.org/W2378557713","https://openalex.org/W2141701778","https://openalex.org/W3169691842","https://openalex.org/W2089402478"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4],"the":[5,13,56,74,94,103,107,129,132],"knapsack":[6,17,62,95],"sharing":[7],"problem":[8,57],"(KSP),":[9],"a":[10,31,36,50,59,68,88],"variant":[11],"of":[12,61,90,102,106,131],"well-known":[14],"NP-hard":[15],"single":[16],"problem.":[18],"We":[19],"propose":[20],"an":[21,82],"exact":[22,109,116],"constructive":[23],"tree":[24],"search":[25,34,42,85],"that":[26,54,72,86],"combines":[27],"two":[28],"complementary":[29],"procedures:":[30],"reduction":[32,41,52,70,84,133],"interval":[33,83],"and":[35,38,120],"branch":[37],"bound.":[39],"The":[40,46,64,78],"has":[43],"three":[44],"phases.":[45],"first":[47],"phase":[48,66,80],"applies":[49],"polynomial":[51],"strategy":[53,71],"decomposes":[55],"into":[58],"series":[60],"problems.":[63,96],"second":[65],"is":[67,81],"size":[69],"makes":[73],"resolution":[75],"more":[76],"efficient.":[77],"third":[79],"identifies":[87],"set":[89],"optimal":[91],"capacities":[92],"characterizing":[93],"Experimental":[97],"results":[98],"provide":[99],"computational":[100],"evidence":[101],"better":[104],"performance":[105],"proposed":[108],"algorithm":[110],"in":[111],"comparison":[112],"to":[113,118,121],"KSPs":[114,122],"best":[115],"algorithm,":[117],"Cplex":[119],"latest":[123],"heuristic":[124],"approach.":[125],"Furthermore,":[126],"they":[127],"emphasize":[128],"importance":[130],"strategies.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}