{"id":"https://openalex.org/W2769023643","doi":"https://doi.org/10.1109/codit.2017.8102641","title":"A reactive search for the quadratic knapsack problem","display_name":"A reactive search for the quadratic knapsack problem","publication_year":2017,"publication_date":"2017-04-01","ids":{"openalex":"https://openalex.org/W2769023643","doi":"https://doi.org/10.1109/codit.2017.8102641","mag":"2769023643"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2017.8102641","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2017.8102641","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-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/A5022868166","display_name":"Najat Hameed Qasim Al-Iedani","orcid":"https://orcid.org/0000-0001-8456-4070"},"institutions":[{"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"],"is_corresponding":true,"raw_author_name":"Najat Al-Iedani","raw_affiliation_strings":["Universit\u00e9 de Picardie Jules Verne, EPROAD EA-4669, Amiens, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Picardie Jules Verne, EPROAD EA-4669, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044647341","display_name":"Mhand Hifi","orcid":"https://orcid.org/0000-0002-1031-7701"},"institutions":[{"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"],"is_corresponding":false,"raw_author_name":"Mhand Hifi","raw_affiliation_strings":["Universite de Picardie Jules Verne, Amiens, Hauts-de-France, FR"],"affiliations":[{"raw_affiliation_string":"Universite de Picardie Jules Verne, Amiens, Hauts-de-France, FR","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050013740","display_name":"Toufik Saadi","orcid":null},"institutions":[{"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"],"is_corresponding":false,"raw_author_name":"Toufik Saadi","raw_affiliation_strings":["Universit\u00e9 de Picardie Jules Verne, EPROAD EA-4669, Amiens, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Picardie Jules Verne, EPROAD EA-4669, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022868166"],"corresponding_institution_ids":["https://openalex.org/I4647051"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.22747685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"226","issue":null,"first_page":"0495","last_page":"0499"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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.9998000264167786,"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.9973000288009644,"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.9950000047683716,"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.9926356077194214},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7284903526306152},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5552668571472168},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5227049589157104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5048378109931946},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48069435358047485},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45843276381492615},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4501960277557373},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.43491196632385254},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.4330374002456665},{"id":"https://openalex.org/keywords/profit","display_name":"Profit (economics)","score":0.4225076735019684},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37172600626945496},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20941758155822754},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.07670709490776062}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9926356077194214},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7284903526306152},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5552668571472168},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5227049589157104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5048378109931946},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48069435358047485},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45843276381492615},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4501960277557373},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.43491196632385254},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.4330374002456665},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.4225076735019684},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37172600626945496},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20941758155822754},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.07670709490776062},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit.2017.8102641","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2017.8102641","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1971967801","https://openalex.org/W1989607775","https://openalex.org/W2024911991","https://openalex.org/W2026973340","https://openalex.org/W2029859833","https://openalex.org/W2037140854","https://openalex.org/W2137023518","https://openalex.org/W2141494354","https://openalex.org/W2167807475","https://openalex.org/W2193153428","https://openalex.org/W2250294758","https://openalex.org/W2294876565","https://openalex.org/W2333257440","https://openalex.org/W6684701501"],"related_works":["https://openalex.org/W2005493932","https://openalex.org/W2889442766","https://openalex.org/W2168163332","https://openalex.org/W2378557713","https://openalex.org/W42170116","https://openalex.org/W2009443800","https://openalex.org/W2412614002","https://openalex.org/W1969981152","https://openalex.org/W2087209118","https://openalex.org/W2027111774"],"abstract_inverted_index":{"In":[0,26,214,228],"this":[1],"paper,":[2],"we":[3,218,232],"propose":[4],"an":[5,110],"reactive":[6,243,253],"method":[7,206],"to":[8,45,50,59,137,143,149,267],"solve":[9],"the":[10,30,60,66,74,134,145,151,156,162,194,215,225,229,234,237,252,271,277,281,284,288,293,301],"Quadratic":[11],"Knapsack":[12],"Problem":[13],"(noted":[14],"QKP).":[15],"The":[16,54,131,204,262],"quadratic":[17,31,61,171],"knapsack":[18,32,80,146,163,172],"problem":[19,167,173],"is":[20,57,136,168,207,255,295],"a":[21,35,79,82,86,96,118,139,186,220,242,247],"well-studied":[22],"combinatorial":[23],"optimisation":[24],"problem.":[25],"all":[27],"variants":[28],"of":[29,37,52,88,133,141,188,196,236,283,297,300],"problems,":[33],"for":[34,223],"set":[36,87],"given":[38],"items,":[39],"profits":[40],"are":[41,70,265],"not":[42,160],"only":[43,64],"assigned":[44],"individual":[46],"items":[47,69],"but":[48],"also":[49],"pairs":[51],"them.":[53],"pairwise":[55,119],"profit":[56,105,112,120,153],"added":[58],"objective":[62,132],"value":[63],"when":[65],"two":[67,211],"corresponding":[68],"both":[71,257],"included":[72],"in":[73,193],"same":[75],"knapsack.":[76],"We":[77],"let":[78],"with":[81,125,185,245],"capacity":[83,164],"C":[84],"and":[85,104,117,174,180,249,259,274,287],"candidate":[89],"objects":[90,142],"(or":[91],"items),":[92],"each":[93],"item":[94],"has":[95,175,182],"positive":[97],"weight":[98,158],"w":[99],"<inf":[100,114,122],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[101,115,123],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i</inf>":[102,116],",":[103],"Pi,":[106],"if":[107],"selected,":[108],"generates":[109],"object":[111,129],"p":[113],"P":[121],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">ij</inf>":[124],"any":[126],"other":[127,308],"selected":[128],"j.":[130],"QKP":[135,302],"select":[138],"subset":[140],"fill":[144],"so":[147],"as":[148,170],"maximize":[150],"overall":[152,157],"P,":[154],"while":[155],"does":[159],"exceed":[161],"C.":[165],"This":[166],"known":[169],"been":[176,183],"shown":[177],"strongly":[178],"NP-hard":[179],"it":[181],"applied":[184],"variety":[187],"important":[189],"applications,":[190],"such":[191],"as,":[192],"location":[195],"satellites,":[197],"airports,":[198],"railway":[199],"stations":[200],"or":[201],"freight":[202],"terminals.":[203],"proposed":[205,285],"mainly":[208],"based":[209,240,256],"on":[210,241],"complementary":[212],"phases.":[213],"first":[216],"phase":[217,231,254],"use":[219],"greedy":[221],"algorithm":[222,294],"provide":[224],"starting":[226,238],"solution.":[227],"second":[230],"improved":[233],"quality":[235],"solutions":[239],"search":[244],"applying":[246],"destroy":[248],"repair":[250],"process,":[251],"diversification":[258],"intensification":[260],"strategy.":[261],"obtained":[263],"results":[264,279,290],"compared":[266],"those":[268],"reached":[269],"by":[270,307],"Cplex":[272],"solverl":[273],"literature.":[275],"Consequently,":[276],"experimental":[278],"show":[280,291],"effectiveness":[282],"approach,":[286],"computational":[289],"that":[292,303],"capable":[296],"solving":[298],"instances":[299],"cannot":[304],"be":[305],"solved":[306],"methods.":[309]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}