{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T16:02:42Z","timestamp":1756310562478,"version":"3.35.0"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T00:00:00Z","timestamp":1639094400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T00:00:00Z","timestamp":1639094400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,10]]},"DOI":"10.1109\/paap54281.2021.9720471","type":"proceedings-article","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T20:26:05Z","timestamp":1646425565000},"page":"56-61","source":"Crossref","is-referenced-by-count":3,"title":["On the adoption of Metaheuristics for Solving 0\u20131 Knapsack Problems"],"prefix":"10.1109","author":[{"given":"Yang","family":"Qiu","sequence":"first","affiliation":[{"name":"Wenzhou-Kean University,Department of Computer Science,Wenzhou,CHINA,325060"}]},{"given":"Haomiao","family":"Li","sequence":"additional","affiliation":[{"name":"Wenzhou-Kean University,Department of Computer Science,Wenzhou,CHINA,325060"}]},{"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[{"name":"Wenzhou-Kean University,Department of Computer Science,Wenzhou,CHINA,325060"}]},{"given":"Omar","family":"Dib","sequence":"additional","affiliation":[{"name":"Wenzhou-Kean University,Department of Computer Science,Wenzhou,CHINA,325060"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICRAIE51050.2020.9358351"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.804320"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2723538"},{"key":"ref13","first-page":"56","article-title":"Improved Genetic Algorithm Based on Critical Self-Organization and Gaussian Memory for Solving Dynamic Optimization Problems","volume":"9","author":"mohammadpour","year":"2021","journal-title":"Soft Computing Journal"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3230905.3230907"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02717-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.5772\/intechopen.98240"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459343"},{"key":"ref19","article-title":"Design and application of course scheduling system based on tabu search method","volume":"26","author":"zhang","year":"2018","journal-title":"Electronic Design Engineering"},{"journal-title":"0\/1 KNAPSACK PROBLEM GREEDY VS DYNAMI C-PROGRAMMING","year":"0","author":"al etawi","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-017-0731-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2001858.2001891"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-020-05145-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908489"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2897580"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.5815\/ijisa.2019.02.02"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.05.054"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2809445"},{"key":"ref20","first-page":"1833","article-title":"A heuristic algorithm based on expectation efficiency for 0–1 knapsack problem","volume":"14","author":"zhang","year":"2018","journal-title":"International Journal of Innovative Computing Information and Control"}],"event":{"name":"2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)","start":{"date-parts":[[2021,12,10]]},"location":"Xi'an, China","end":{"date-parts":[[2021,12,12]]}},"container-title":["2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9720298\/9720304\/09720471.pdf?arnumber=9720471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T19:13:57Z","timestamp":1738264437000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9720471\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,10]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/paap54281.2021.9720471","relation":{},"subject":[],"published":{"date-parts":[[2021,12,10]]}}}