{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T23:37:45Z","timestamp":1775691465810,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61432002"],"award-info":[{"award-number":["61432002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772155"],"award-info":[{"award-number":["61772155"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772159"],"award-info":[{"award-number":["61772159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key R&D Plan Project of China","award":["SQ2018YFB140017"],"award-info":[{"award-number":["SQ2018YFB140017"]}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province, China","doi-asserted-by":"publisher","award":["ZR2015FM006"],"award-info":[{"award-number":["ZR2015FM006"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key R&D plan Project of Shandong Province, China","award":["GG201703130116"],"award-info":[{"award-number":["GG201703130116"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1016\/j.knosys.2018.11.006","type":"journal-article","created":{"date-parts":[[2018,12,3]],"date-time":"2018-12-03T17:11:05Z","timestamp":1543857065000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"special_numbering":"C","title":["Multiple-class multidimensional knapsack optimisation problem and its solution approaches"],"prefix":"10.1016","volume":"166","author":[{"given":"Fanchao","family":"Meng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dianhui","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keqiu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuequan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.knosys.2018.11.006_b1","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s10732-005-2634-9","article-title":"Very large-scale neighborhood search for the k-constraint multiple knapsack problem","volume":"11","author":"Ahuja","year":"2005","journal-title":"J. Heuristics."},{"issue":"2","key":"10.1016\/j.knosys.2018.11.006_b2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.ejor.2014.05.025","article-title":"A \u201creduce and solve\u201d approach for the multiple-choice multidimensional knapsack problem","volume":"239","author":"Chen","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.knosys.2018.11.006_b3","series-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)","first-page":"547","article-title":"The quadratic multiple knapsack problem and three heuristic approaches to it","author":"Hiley","year":"2006"},{"key":"10.1016\/j.knosys.2018.11.006_b4","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.cor.2013.08.018","article-title":"Generalized quadratic multiple knapsack problem and two solution approaches","volume":"43","author":"Sarac","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.knosys.2018.11.006_b5","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":"Chen","year":"2016","journal-title":"Knowl.-Based Syst."},{"issue":"1","key":"10.1016\/j.knosys.2018.11.006_b6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.knosys.2018.01.012","article-title":"A Repair-based approach for stochastic quadratic multiple knapsack problem","volume":"145","author":"Song","year":"2018","journal-title":"Knowl.-Based Syst."},{"issue":"5","key":"10.1016\/j.knosys.2018.11.006_b7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.cor.2017.12.017","article-title":"Relaxations and heuristics for the multiple non-linear separable knapsack problem","volume":"93","author":"D\u2019Ambrosio","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.knosys.2018.11.006_b8","series-title":"Proceedings of 2015 IEEE International Conference on Smart City\/SocialCom\/SustainCom (SmartCity)","first-page":"1086","article-title":"A cost-driven multi-objective optimisation algorithm for SaaS applications placement","author":"Qian","year":"2015"},{"issue":"3","key":"10.1016\/j.knosys.2018.11.006_b9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.jcss.2016.07.007","article-title":"An AFPTAS for variable sized bin packing with general activation costs","volume":"84","author":"Epsyein","year":"2017","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10.1016\/j.knosys.2018.11.006_b10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.cor.2016.11.015","article-title":"An exact approach for the 0-1 knapsack problem with setups","volume":"80","author":"Croce","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.knosys.2018.11.006_b11","first-page":"208","article-title":"Exact approaches for the knapsack problem with setups","volume":"90","author":"Fabio","year":"2018","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.knosys.2018.11.006_b12","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1016\/j.ejor.2007.10.024","article-title":"An exact algorithm for the fixed-charge multiple knapsack problem","volume":"192","author":"Yamada","year":"2009","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10.1016\/j.knosys.2018.11.006_b13","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.disopt.2009.04.004","article-title":"Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem","volume":"6","author":"Sne\u017eana","year":"2009","journal-title":"Discrete Optim."},{"issue":"3","key":"10.1016\/j.knosys.2018.11.006_b14","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","article-title":"A survey of algorithms for the generalized assignment problem","volume":"60","author":"Cattrysse","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.knosys.2018.11.006_b15","series-title":"Genetic Algorithm and Engineering Design","author":"Gen","year":"1997"},{"issue":"15","key":"10.1016\/j.knosys.2018.11.006_b16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.eswa.2016.01.055","article-title":"Taming the 0\/1 knapsack problem with monogamous pairs genetic algorithm","volume":"54","author":"Lim","year":"2016","journal-title":"Expert Syst. Appl."},{"issue":"25","key":"10.1016\/j.knosys.2018.11.006_b17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.neucom.2014.04.069","article-title":"On the performance of linkage-tree genetic algorithms for the multidimensional knapsack problem","volume":"146","author":"Martins","year":"2014","journal-title":"Neurocomputing."},{"key":"10.1016\/j.knosys.2018.11.006_b18","series-title":"Proceedings of the Genetic and Evolutionary Computation Conference","first-page":"607","article-title":"genetic and greedy genetic algorithms for the quadratic knapsack problem","author":"Julstrom","year":"2015"},{"key":"10.1016\/j.knosys.2018.11.006_b19","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/j.knosys.2018.11.006_b20","series-title":"Proceedings of 28th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","first-page":"134","article-title":"A parallelization of a simulated annealing approach for 0-1 multidimensional knapsack problem using GPGPU","author":"Dantas","year":"2016"},{"issue":"3","key":"10.1016\/j.knosys.2018.11.006_b21","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.cie.2017.01.015","article-title":"Two-dimensional disjunctively constrained knapsack problem: Heuristic and exact approaches","volume":"105","author":"de\u00a0Queiroz","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.knosys.2018.11.006_b22","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"6","key":"10.1016\/j.knosys.2018.11.006_b23","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"J. Chem. Phys."},{"key":"10.1016\/j.knosys.2018.11.006_b24","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.ejor.2014.02.014","article-title":"Upper and lower bounding procedures for the multiple knapsack assignment problem","volume":"237","author":"Kataoka","year":"2014","journal-title":"European J. Oper. Res."},{"issue":"11","key":"10.1016\/j.knosys.2018.11.006_b25","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.cor.2015.04.018","article-title":"Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm","volume":"63","author":"Kong","year":"2015","journal-title":"Comput. Oper. Res."},{"issue":"23","key":"10.1016\/j.knosys.2018.11.006_b26","doi-asserted-by":"crossref","first-page":"11018","DOI":"10.1016\/j.amc.2013.05.016","article-title":"Subset selection in multiple linear regression modes: a hybrid of genetic and simulated annealing algorithms","volume":"129","author":"Orkcu","year":"2013","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"10.1016\/j.knosys.2018.11.006_b27","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10479-013-1322-7","article-title":"A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems","volume":"206","author":"Xu","year":"2013","journal-title":"Ann. Oper. Res."}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705118305422?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705118305422?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T12:26:47Z","timestamp":1662553607000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705118305422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":27,"alternative-id":["S0950705118305422"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2018.11.006","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2019,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Multiple-class multidimensional knapsack optimisation problem and its solution approaches","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2018.11.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}