{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:22:05Z","timestamp":1757780525112,"version":"3.41.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/cec.2016.7744199","type":"proceedings-article","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T22:22:49Z","timestamp":1480544569000},"page":"3238-3245","source":"Crossref","is-referenced-by-count":2,"title":["Restricting the search space to boost Quantum Annealing performance"],"prefix":"10.1109","author":[{"given":"Pierre","family":"Berge","sequence":"first","affiliation":[]},{"given":"Baptiste","family":"Cavarec","sequence":"additional","affiliation":[]},{"given":"Arpad","family":"Rimmel","sequence":"additional","affiliation":[]},{"given":"Joanna","family":"Tomasik","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00308-7"},{"journal-title":"TSP library","year":"2013","author":"reinelt","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009642405419"},{"key":"ref14","first-page":"328","article-title":"A hybrid approach for the 0–1 multidimensional knapsack problem","author":"vasquez","year":"2001","journal-title":"Proc of IJCAI"},{"journal-title":"Heidelberg and combinatorial optimization (2007) Optimal solutions for symmetric tsps","year":"0","author":"universit\u00e4t","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/11499305_3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.057701"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.80.1061"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","article-title":"Reductibility among combinatorial problems","author":"karp","year":"1972","journal-title":"Comput Compl"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.12.001"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2307\/2322600"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242185"},{"key":"ref2","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"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1143\/PTP.56.1454"}],"event":{"name":"2016 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2016,7,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2016,7,29]]}},"container-title":["2016 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7636124\/7743769\/07744199.pdf?arnumber=7744199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T23:25:59Z","timestamp":1749770759000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7744199\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/cec.2016.7744199","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}