{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:27:30Z","timestamp":1725496050838},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770459"},{"type":"electronic","value":"9783540770466"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77046-6_31","type":"book-chapter","created":{"date-parts":[[2007,11,27]],"date-time":"2007-11-27T12:53:02Z","timestamp":1196167982000},"page":"252-260","source":"Crossref","is-referenced-by-count":11,"title":["Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems"],"prefix":"10.1007","author":[{"given":"C.","family":"Patvardhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Apurva","family":"Narayan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Srivastav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1287\/mnsc.34.5.633","volume":"34","author":"S. Martello","year":"1988","unstructured":"Martello, S., Toth, P.: A new algorithm for the 0-1 knapsack problem. Management Science\u00a034, 633\u2013644 (1988)","journal-title":"Management Science"},{"key":"31_CR2","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. J. Wiley, Chichester (1990)"},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/opre.45.5.768","volume":"45","author":"S. Martello","year":"1997","unstructured":"Martello, S., Toth, P.: Upper bounds and algorithms for hard 0-1 knapsack problems. Operations Research\u00a045, 768\u2013778 (1997)","journal-title":"Operations Research"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/828.322450","volume":"31","author":"F.M..a.. Heide der","year":"1984","unstructured":"der Heide, F.M.a.: A polynomial linear search algorithm for the n-dimensional knapsack problem. Journal of the ACM\u00a031, 668\u2013676 (1984)","journal-title":"Journal of the ACM"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0377-2217(94)00013-3","volume":"87","author":"D. Pisinger","year":"1995","unstructured":"Pisinger, D.: An expanding-core algorithm for the exact 0-1 knapsack problem. European Journal of Operational Research\u00a087, 175\u2013187 (1995)","journal-title":"European Journal of Operational Research"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Pisinger, D.: Where are the Hard Knapsack Problems, Technical Report, 2003-8, DIKU, University of Copenhagen, Denmark","DOI":"10.1016\/S0305-0548(04)00036-X"},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S. Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Science\u00a045, 414\u2013424 (1999)","journal-title":"Management Science"},{"issue":"6","key":"31_CR8","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","volume":"6","author":"K.H. Han","year":"2002","unstructured":"Han, K.H., Kim, J.H.: Quantum-Inspired Evolutionary Algorithm for a Class of Combinatorial Optimization. IEEE Transactions on Evolutionary Computation\u00a06(6), 580\u2013593 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/TEVC.2004.823467","volume":"8","author":"K.H. Han","year":"2002","unstructured":"Han, K.H., Kim, J.H.: Quantum-Inspired Evolutionary Algorithms with a New Termination Criterion, H\u03b5 Gate, and Two-Phase Scheme. IEEE Transactions on Evolutionary Computation\u00a08(2), 156\u2013169 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77046-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:13:22Z","timestamp":1558278802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77046-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770459","9783540770466"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77046-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}