{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:59:12Z","timestamp":1764687552377,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1109\/icsmc.2009.5346276","type":"proceedings-article","created":{"date-parts":[[2009,12,10]],"date-time":"2009-12-10T14:44:31Z","timestamp":1260456271000},"page":"1388-1392","source":"Crossref","is-referenced-by-count":7,"title":["A novel quantum evolutionary algorithm for quadratic Knapsack problem"],"prefix":"10.1109","author":[{"given":"Apurva","family":"Narayan","sequence":"first","affiliation":[]},{"given":"C.","family":"Patvardhan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1049\/cce:19990303"},{"year":"0","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77046-6_31"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.2.125"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.804320"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1985.0070"},{"key":"3","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/0377-2217(94)00229-0","article-title":"A new upper-bound and an exact algorithm for the 0-1 quadratic knapsack problem","volume":"92","author":"billionnet","year":"1996","journal-title":"European Journal of Operation Research"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00229-0"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0120892","article-title":"Quadratic knapsack problems","author":"gallo","year":"1980","journal-title":"Journal of Mathematical Programming"},{"key":"10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(93)90097-7","article-title":"A cutting-plane approach to the edge-weighted maximal cique problem","volume":"69","author":"dijkhuizen","year":"1993","journal-title":"European Journal of Operation Research"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.7.1.109"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61310-2_14"},{"key":"5","first-page":"170","article-title":"Efficient methods for solving quadratic 0-1 knapsack problems","author":"hammer","year":"1997","journal-title":"Proc INFOR"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00286-X"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585164"},{"key":"8","doi-asserted-by":"crossref","DOI":"10.6028\/NBS.IR.75-737","article-title":"Mathematical methods of site selection for electronic message systems(ems)","author":"witzgall","year":"1975"}],"event":{"name":"2009 IEEE International Conference on Systems, Man and Cybernetics - SMC","start":{"date-parts":[[2009,10,11]]},"location":"San Antonio, TX, USA","end":{"date-parts":[[2009,10,14]]}},"container-title":["2009 IEEE International Conference on Systems, Man and Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5340904\/5345886\/05346276.pdf?arnumber=5346276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:19:43Z","timestamp":1558685983000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5346276\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icsmc.2009.5346276","relation":{},"subject":[],"published":{"date-parts":[[2009,10]]}}}