{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:23:08Z","timestamp":1729628588563,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/icnsc.2016.7478998","type":"proceedings-article","created":{"date-parts":[[2016,5,26]],"date-time":"2016-05-26T20:26:53Z","timestamp":1464294413000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["A new fast reduction algorithm for binary knapsack problem"],"prefix":"10.1109","author":[{"given":"Xiaohua","family":"Xiong","sequence":"first","affiliation":[]},{"given":"Aibing","family":"Ning","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.1.75.11898"},{"article-title":"Discrete Optimization Algorithms","year":"1983","author":"syslo","key":"ref11"},{"key":"ref12","article-title":"0–1 Knapsack Problems","volume":"2","author":"plateau","year":"0","journal-title":"Paradigms of Combinatorial Optimization Problems and New Approaches"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1016\/j.cor.2003.11.005","article-title":"An exact algorithm for the knapsack sharing problem","volume":"32","author":"mhand","year":"2005","journal-title":"Computers & Operations Research"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.endm.2010.05.079","article-title":"A New Lagrangian Based Branch and Bound Algorithm for the 0–1 Knapsack Problem","volume":"36","author":"alexandre","year":"2010","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58495-1_14"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2014.6975886"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02241754"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.4.460"},{"article-title":"Knapsack Problems-Algorithms and Computer Implementations","year":"1990","author":"martello","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00260-X"},{"article-title":"Algorithms For Knapsack Problems","year":"1995","author":"pisinger","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(77)90024-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.5.2.266"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.5.1130"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.03.002"}],"event":{"name":"2016 IEEE 13th International Conference on Networking, Sensing and Control (ICNSC)","start":{"date-parts":[[2016,4,28]]},"location":"Mexico City, Mexico","end":{"date-parts":[[2016,4,30]]}},"container-title":["2016 IEEE 13th International Conference on Networking, Sensing, and Control (ICNSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7470729\/7478962\/07478998.pdf?arnumber=7478998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T15:08:42Z","timestamp":1498316922000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7478998\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icnsc.2016.7478998","relation":{},"subject":[],"published":{"date-parts":[[2016,4]]}}}