{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:44:47Z","timestamp":1729637087437,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1109\/codit.2017.8102641","type":"proceedings-article","created":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T16:15:31Z","timestamp":1511885731000},"page":"0495-0499","source":"Crossref","is-referenced-by-count":1,"title":["A reactive search for the quadratic knapsack problem"],"prefix":"10.1109","author":[{"given":"Najat","family":"Al-Iedani","sequence":"first","affiliation":[]},{"given":"Mhand","family":"Hifi","sequence":"additional","affiliation":[]},{"given":"Toufik","family":"Saadi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"607614","article-title":"Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem","author":"julstrom","year":"2007","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602046"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s10479-014-1720-5","article-title":"Iterated responsive threshold search for the quadratic multiple knapsack problem","volume":"226","author":"yuning","year":"2015","journal-title":"Annals of Operations Research"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.10.004"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.knosys.2016.01.014","article-title":"The bi-objective quadratic multiple knapsack problem, model and heuristics","volume":"97","author":"yuning","year":"2016","journal-title":"Knowledge-Based Systems"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/TEVC.2016.2546340","article-title":"Memetic search for the generalized quadratic multiple knapsack problem","volume":"20","author":"yuning","year":"2016","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00229-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00286-X"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00244-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.2.125"},{"year":"0","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1030.0029"},{"key":"ref2","first-page":"225235","article-title":"Best network flow bound for the quadratic knapsack problem","volume":"1403","author":"chaillou","year":"1986","journal-title":"Combinatorial Optimization Lecture Notes in Math"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120892"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1050.0172"}],"event":{"name":"2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)","start":{"date-parts":[[2017,4,5]]},"location":"Barcelona, Spain","end":{"date-parts":[[2017,4,7]]}},"container-title":["2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8091148\/8102545\/08102641.pdf?arnumber=8102641","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T00:18:55Z","timestamp":1570407535000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8102641\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/codit.2017.8102641","relation":{},"subject":[],"published":{"date-parts":[[2017,4]]}}}