{"id":"https://openalex.org/W2068261044","doi":"https://doi.org/10.4018/jamc.2012100103","title":"A Filter-and-Fan Metaheuristic for the 0-1 Multidimensional Knapsack Problem","display_name":"A Filter-and-Fan Metaheuristic for the 0-1 Multidimensional Knapsack Problem","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2068261044","doi":"https://doi.org/10.4018/jamc.2012100103","mag":"2068261044"},"language":"en","primary_location":{"id":"doi:10.4018/jamc.2012100103","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jamc.2012100103","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","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/A5103186960","display_name":"Mahdi Khemakhem","orcid":"https://orcid.org/0000-0001-5603-1947"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Mahdi Khemakhem","raw_affiliation_strings":["LOGIQ \u2013 ISGI, University of Sfax, Sfax, Tunisia","[LOGIQ ISGI, University of Sfax, Sfax, Tunisia]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LOGIQ \u2013 ISGI, University of Sfax, Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]},{"raw_affiliation_string":"[LOGIQ ISGI, University of Sfax, Sfax, Tunisia]","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041573908","display_name":"Boukthir Haddar","orcid":"https://orcid.org/0000-0002-1620-0993"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Boukthir Haddar","raw_affiliation_strings":["LOGIQ \u2013 ISGI, University of Sfax, Sfax, Tunisia","[LOGIQ ISGI, University of Sfax, Sfax, Tunisia]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LOGIQ \u2013 ISGI, University of Sfax, Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]},{"raw_affiliation_string":"[LOGIQ ISGI, University of Sfax, Sfax, Tunisia]","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049559828","display_name":"Khalil Chebil","orcid":"https://orcid.org/0000-0002-7571-4150"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Khalil Chebil","raw_affiliation_strings":["LOGIQ \u2013 ISGI, University of Sfax, Sfax, Tunisia","[LOGIQ ISGI, University of Sfax, Sfax, Tunisia]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LOGIQ \u2013 ISGI, University of Sfax, Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]},{"raw_affiliation_string":"[LOGIQ ISGI, University of Sfax, Sfax, Tunisia]","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110933305","display_name":"Sa\u00efd Hanafi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210089617","display_name":"Laboratoire d'Automatique, de M\u00e9canique et d'Informatique Industrielles et Humaines","ror":"https://ror.org/006z7v557","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210089617","https://openalex.org/I4210159245","https://openalex.org/I4387154098","https://openalex.org/I70348806","https://openalex.org/I70348806"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sa\u00efd Hanafi","raw_affiliation_strings":["LAMIH, University of Valenciennes, Valenciennes, France","LAMIH, University of Valenciennes, Valenciennes, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMIH, University of Valenciennes, Valenciennes, France","institution_ids":["https://openalex.org/I4210089617"]},{"raw_affiliation_string":"LAMIH, University of Valenciennes, Valenciennes, France#TAB#","institution_ids":["https://openalex.org/I4210089617"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6943,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.76942716,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"3","issue":"4","first_page":"43","last_page":"63"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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.9965000152587891,"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.8801209926605225},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.8458197116851807},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6745430827140808},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6630489826202393},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6612635254859924},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6392886638641357},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6323105096817017},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.5646623373031616},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4897206127643585},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48849356174468994},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45795994997024536},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4415859878063202},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3920183479785919},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14065110683441162}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8801209926605225},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8458197116851807},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6745430827140808},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6630489826202393},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6612635254859924},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6392886638641357},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6323105096817017},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.5646623373031616},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4897206127643585},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48849356174468994},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45795994997024536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4415859878063202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3920183479785919},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14065110683441162},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/jamc.2012100103","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jamc.2012100103","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jamc00:v:3:y:2012:i:4:p:43-63","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2012100103","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W234472833","https://openalex.org/W1492845317","https://openalex.org/W1518581532","https://openalex.org/W1549861824","https://openalex.org/W1586409345","https://openalex.org/W1968838253","https://openalex.org/W1972300623","https://openalex.org/W1972314001","https://openalex.org/W1978303883","https://openalex.org/W1984243901","https://openalex.org/W1989593435","https://openalex.org/W2012761904","https://openalex.org/W2015206115","https://openalex.org/W2020008181","https://openalex.org/W2021328726","https://openalex.org/W2033971020","https://openalex.org/W2034850884","https://openalex.org/W2043513057","https://openalex.org/W2049967755","https://openalex.org/W2052307457","https://openalex.org/W2058578326","https://openalex.org/W2062924625","https://openalex.org/W2066635774","https://openalex.org/W2066671865","https://openalex.org/W2069657950","https://openalex.org/W2077604419","https://openalex.org/W2080821553","https://openalex.org/W2081751877","https://openalex.org/W2089131950","https://openalex.org/W2093436788","https://openalex.org/W2094662666","https://openalex.org/W2095018715","https://openalex.org/W2095703590","https://openalex.org/W2102543230","https://openalex.org/W2104515359","https://openalex.org/W2171682893","https://openalex.org/W2172262914","https://openalex.org/W4212899374","https://openalex.org/W4236127247","https://openalex.org/W4256012320"],"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/W2145407993","https://openalex.org/W2005493932","https://openalex.org/W2378557713","https://openalex.org/W2141701778","https://openalex.org/W2133728917"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,21,33,38,44,75,98],"new":[4],"hybrid":[5],"tree":[6,80],"search":[7,19,26,53],"algorithm":[8],"to":[9,42,47,57,59,91,113],"the":[10,48,61,67,84,88,92,106,109,114],"Multidimensional":[11],"Knapsack":[12],"Problem":[13],"(MKP)":[14],"that":[15,70],"effectively":[16],"combines":[17],"tabu":[18,52],"with":[20],"dynamic":[22],"and":[23],"adaptive":[24],"neighborhood":[25],"procedure.":[27],"The":[28],"authors\u2019":[29],"heuristic,":[30],"based":[31],"on":[32,97],"filter-and-fan":[34],"(F&F)":[35],"procedure,":[36],"uses":[37],"Linear":[39],"Programming-based":[40],"Heuristic":[41],"generate":[43],"starting":[45],"solution":[46,63],"F&F":[49,68,89],"process.":[50],"A":[51],"procedure":[54],"is":[55],"used":[56],"try":[58],"enhance":[60],"best":[62],"value":[64],"provided":[65],"by":[66,74],"method":[69,90,111],"generates":[71],"compound":[72],"moves":[73],"strategically":[76],"truncated":[77],"form":[78],"of":[79,87,101,108],"search.":[81],"They":[82],"report":[83],"first":[85],"application":[86],"MKP.":[93],"Experimental":[94],"results":[95],"obtained":[96],"wide":[99],"set":[100],"benchmark":[102],"problems":[103],"clearly":[104],"demonstrate":[105],"competitiveness":[107],"proposed":[110],"compared":[112],"state-of-the-art":[115],"heuristic":[116],"methods.":[117]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}