{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:56Z","timestamp":1740122636741,"version":"3.37.3"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,21]],"date-time":"2022-02-21T00:00:00Z","timestamp":1645401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,21]],"date-time":"2022-02-21T00:00:00Z","timestamp":1645401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100013345","name":"Fujitsu Laboratories of America","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100013345","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10589-022-00354-2","type":"journal-article","created":{"date-parts":[[2022,2,21]],"date-time":"2022-02-21T18:09:51Z","timestamp":1645466991000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Leveraging special-purpose hardware for local search heuristics"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1084-9713","authenticated-orcid":false,"given":"Xiaoyuan","family":"Liu","sequence":"first","affiliation":[]},{"given":"Hayato","family":"Ushijima-Mwesigwa","sequence":"additional","affiliation":[]},{"given":"Avradip","family":"Mandal","sequence":"additional","affiliation":[]},{"given":"Sarvagya","family":"Upadhyay","sequence":"additional","affiliation":[]},{"given":"Ilya","family":"Safro","sequence":"additional","affiliation":[]},{"given":"Arnab","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,21]]},"reference":[{"key":"354_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.3389\/fphy.2019.00048","volume":"7","author":"M Aramon","year":"2019","unstructured":"Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., Katzgrabeer, H.: Physics-inspired optimization for quadratic unconstrained problems using a digital annealer. Front. Phys. 7, 48 (2019)","journal-title":"Front. Phys."},{"issue":"4","key":"354_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1002\/nla.1680020402","volume":"2","author":"ST Barnard","year":"1995","unstructured":"Barnard, S.T., Pothen, A., Simon, H.: A spectral algorithm for envelope reduction of sparse matrices. Numer. Linear Algebra Appl. 2(4), 317\u2013334 (1995)","journal-title":"Numer. Linear Algebra Appl."},{"key":"354_CR3","doi-asserted-by":"crossref","unstructured":"Bock, F.: An algorithm for solving travelling-salesman and related network optimization problems. In: Operations Research, vol.\u00a06, pp. 897. Institute for Operations Research and the Management Sciences (1958)","DOI":"10.1287\/opre.6.6.791"},{"issue":"2","key":"354_CR4","first-page":"129","volume":"20","author":"EG Boman","year":"2012","unstructured":"Boman, E.G., \u00c7ataly\u00fcrek, \u00dc.V., Chevalier, C., Devine, K.D.: The zoltan and isorropia parallel toolkits for combinatorial scientific computing: Partitioning, ordering and coloring. Sci. Program. 20(2), 129\u2013150 (2012)","journal-title":"Sci. Program."},{"key":"354_CR5","unstructured":"Booth, M., Reinhardt, S.P., Roy, A.: Partitioning optimization problems for hybrid classical. Quantum execution. Technical Report pp. 01\u201309 (2017)"},{"key":"354_CR6","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning. In: Algorithm Engineering, pp. 117\u2013158. Springer (2016)","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"354_CR7","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Cela, E., Pardalos, P.M., Pitsoulis, L.S.: The quadratic assignment problem. In: Handbook of Combinatorial Optimization, pp. 1713\u20131809. Springer (1998)","DOI":"10.1007\/978-1-4613-0303-9_27"},{"issue":"4","key":"354_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: Qaplib-a quadratic assignment problem library. J. Glob. Optim. 10(4), 391\u2013403 (1997)","journal-title":"J. Glob. Optim."},{"key":"354_CR9","doi-asserted-by":"crossref","unstructured":"Coffrin, C., Nagarajan, H., Bent, R.: Evaluating ising processing units with integer programming. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 163\u2013181. Springer (2019)","DOI":"10.1007\/978-3-030-19212-9_11"},{"key":"354_CR10","unstructured":"Crawford, D., Levit, A., Ghadermarzy, N., Oberoi, J.S., Ronagh, P.: Reinforcement learning using quantum boltzmann machines. arXiv preprint arXiv:1612.05695 (2016)"},{"key":"354_CR11","unstructured":"Dash, S.: A note on qubo instances defined on chimera graphs. arXiv preprint arXiv:1306.1202 (2013)"},{"key":"354_CR12","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014). https:\/\/arxiv.org\/abs\/arXiv:1411.4028"},{"key":"354_CR13","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. arXiv preprint quant-ph\/0001106 (2000)"},{"key":"354_CR14","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: 19th Design Automation Conference, pp. 175\u2013181. IEEE (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"issue":"3","key":"354_CR15","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/S089547989427470X","volume":"18","author":"A George","year":"1997","unstructured":"George, A., Pothen, A.: An analysis of spectral envelope reduction via quadratic assignment problems. SIAM J. Matrix Anal. Appl. 18(3), 706\u2013732 (1997)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"354_CR16","unstructured":"Glover, F., Kochenberger, G.: A tutorial on formulating qubo models. arXiv preprint arXiv:1811.11538 (2018)"},{"issue":"3","key":"354_CR17","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1287\/mnsc.44.3.336","volume":"44","author":"F Glover","year":"1998","unstructured":"Glover, F., Kochenberger, G.A., Alidaee, B.: Adaptive memory tabu search for binary quadratic programs. Manag. Sci. 44(3), 336\u2013345 (1998)","journal-title":"Manag. Sci."},{"key":"354_CR18","unstructured":"Gurobi\u00a0Optimization, I.: Gurobi optimizer reference manual (2018)"},{"issue":"2","key":"354_CR19","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3390\/a12020034","volume":"12","author":"S Hadfield","year":"2019","unstructured":"Hadfield, S., Wang, Z., O\u2019Gorman, B., Rieffel, E., Venturelli, D., Biswas, R.: From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12(2), 34 (2019). https:\/\/doi.org\/10.3390\/a12020034","journal-title":"Algorithms"},{"key":"354_CR20","unstructured":"Hamze, F., de\u00a0Freitas, N.: From fields to trees. In: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, pp. 243\u2013250. AUAI Press (2004)"},{"key":"354_CR21","doi-asserted-by":"crossref","unstructured":"Hastings, W.K.: Monte Carlo sampling methods using Markov chains and their applications (1970)","DOI":"10.1093\/biomet\/57.1.97"},{"key":"354_CR22","doi-asserted-by":"crossref","unstructured":"Henderson, M., Novak, J., Cook, T.: Leveraging adiabatic quantum computation for election forecasting. arXiv preprint arXiv:1802.00069 (2018)","DOI":"10.7566\/JPSJ.88.061009"},{"issue":"5","key":"354_CR23","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s11128-017-1586-y","volume":"16","author":"M Hernandez","year":"2017","unstructured":"Hernandez, M., Aramon, M.: Enhancing quantum annealing performance for the molecular similarity problem. Quantum Inf. Process. 16(5), 133 (2017)","journal-title":"Quantum Inf. Process."},{"key":"354_CR24","unstructured":"Hernandez, M., Zaribafiyan, A., Aramon, M., Naghibi, M.: A novel graph-based approach for determining molecular similarity. arXiv preprint arXiv:1601.06693 (2016)"},{"issue":"6312","key":"354_CR25","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1126\/science.aah4243","volume":"354","author":"T Inagaki","year":"2016","unstructured":"Inagaki, T., Haribara, Y., Igarashi, K., Sonobe, T., Tamate, S., Honjo, T., Marandi, A., McMahon, P.L., Umeki, T., Enbutsu, K., et al.: A coherent ising machine for 2000-node optimization problems. Science 354(6312), 603\u2013606 (2016)","journal-title":"Science"},{"issue":"7346","key":"354_CR26","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1038\/nature10012","volume":"473","author":"MW Johnson","year":"2011","unstructured":"Johnson, M.W., Amin, M.H., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A.J., Johansson, J., Bunyk, P., et al.: Quantum annealing with manufactured spins. Nature 473(7346), 194 (2011)","journal-title":"Nature"},{"issue":"5","key":"354_CR27","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"T Kadowaki","year":"1998","unstructured":"Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse ising model. Phys. Rev. E 58(5), 5355 (1998)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"354_CR28","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"354_CR29","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"354_CR30","doi-asserted-by":"publisher","first-page":"014001","DOI":"10.1088\/2058-9565\/aada1f","volume":"4","author":"A Khoshaman","year":"2018","unstructured":"Khoshaman, A., Vinci, W., Denis, B., Andriyash, E., Amin, M.H.: Quantum variational autoencoder. Quantum Sci. Technol. 4(1), 014001 (2018)","journal-title":"Quantum Sci. Technol."},{"key":"354_CR31","doi-asserted-by":"crossref","unstructured":"Kielpinski, D., Bose, R., Pelc, J., Van\u00a0Vaerenbergh, T., Mendoza, G., Tezak, N., Beausoleil, R.G.: Information processing with large-scale optical integrated circuits. In: 2016 IEEE International Conference on Rebooting Computing (ICRC), pp. 1\u20134. IEEE (2016)","DOI":"10.1109\/ICRC.2016.7738704"},{"issue":"4598","key":"354_CR32","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"354_CR33","doi-asserted-by":"crossref","unstructured":"Kochenberger, G.A., Glover, F.: A unified framework for modeling and solving combinatorial optimization problems: a tutorial. In: Multiscale Optimization Methods and Applications, pp. 101\u2013124. Springer (2006)","DOI":"10.1007\/0-387-29550-X_4"},{"key":"354_CR34","unstructured":"Levit, A., Crawford, D., Ghadermarzy, N., Oberoi, J.S., Zahedinejad, E., Ronagh, P.: Free energy-based reinforcement learning using a quantum processor. arXiv preprint arXiv:1706.00074 (2017)"},{"key":"354_CR35","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A.: Ising formulations of many np problems. Front. Phys. 2, 5 (2014)","journal-title":"Front. Phys."},{"key":"354_CR36","doi-asserted-by":"crossref","unstructured":"McGeoch, C.C., Wang, C.: Experimental evaluation of an adiabiatic quantum system for combinatorial optimization. In: Proceedings of the ACM International Conference on Computing Frontiers, p.\u00a023. ACM (2013)","DOI":"10.1145\/2482767.2482797"},{"issue":"6312","key":"354_CR37","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1126\/science.aah5178","volume":"354","author":"PL McMahon","year":"2016","unstructured":"McMahon, P.L., Marandi, A., Haribara, Y., Hamerly, R., Langrock, C., Tamate, S., Inagaki, T., Takesue, H., Utsunomiya, S., Aihara, K., et al.: A fully programmable 100-spin coherent ising machine with all-to-all connections. Science 354(6312), 614\u2013617 (2016)","journal-title":"Science"},{"issue":"6","key":"354_CR38","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"issue":"3","key":"354_CR39","doi-asserted-by":"publisher","first-page":"030503","DOI":"10.1088\/2058-9565\/aab822","volume":"3","author":"N Moll","year":"2018","unstructured":"Moll, N., Barkoutsos, P., Bishop, L.S., Chow, J.M., Cross, A., Egger, D.J., Filipp, S., Fuhrer, A., Gambetta, J.M., Ganzhorn, M., et al.: Quantum optimization using variational algorithms on near-term quantum devices. Quantum Sci. Technol. 3(3), 030503 (2018)","journal-title":"Quantum Sci. Technol."},{"issue":"1","key":"354_CR40","doi-asserted-by":"publisher","first-page":"013304","DOI":"10.1103\/PhysRevE.99.013304","volume":"99","author":"G Nannicini","year":"2019","unstructured":"Nannicini, G.: Performance of hybrid quantum-classical variational heuristics for combinatorial optimization. Phys. Rev. E 99(1), 013304 (2019). https:\/\/doi.org\/10.1103\/PhysRevE.99.013304","journal-title":"Phys. Rev. E"},{"key":"354_CR41","doi-asserted-by":"crossref","unstructured":"Negre, C.F., Ushijima-Mwesigwa, H., Mniszewski, S.M.: Detecting multiple communities using quantum annealing on the d-wave system. arXiv preprint arXiv:1901.09756 (2019)","DOI":"10.1371\/journal.pone.0227538"},{"key":"354_CR42","unstructured":"Neuen, D., Schweitzer, P.: Benchmark graphs for practical graph isomorphism. arXiv preprint arXiv:1705.03686 (2017)"},{"key":"354_CR43","doi-asserted-by":"publisher","first-page":"29","DOI":"10.3389\/fict.2017.00029","volume":"4","author":"F Neukart","year":"2017","unstructured":"Neukart, F., Compostella, G., Seidel, C., Von Dollen, D., Yarkoni, S., Parney, B.: Traffic flow optimization using a quantum annealer. Front ICT 4, 29 (2017)","journal-title":"Front ICT"},{"key":"354_CR44","volume-title":"Quantum Monte Carlo Methods in Physics and Chemistry","author":"MP Nightingale","year":"1998","unstructured":"Nightingale, M.P., Umrigar, C.J.: Quantum Monte Carlo Methods in Physics and Chemistry, vol. 525. Springer, Berlin (1998)"},{"key":"354_CR45","doi-asserted-by":"crossref","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Handbook of Metaheuristics, pp. 399\u2013419. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_13"},{"key":"354_CR46","unstructured":"Puget, J.: D-wave vs cplex comparison. Part 2: Qubo, 2013 (2018)"},{"issue":"6","key":"354_CR47","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1109\/JSTSP.2016.2574703","volume":"10","author":"G Rosenberg","year":"2016","unstructured":"Rosenberg, G., Haghnegahdar, P., Goddard, P., Carr, P., Wu, K., De Prado, M.L.: Solving the optimal trading trajectory problem using a quantum annealer. IEEE J. Sel. Top. Signal Process. 10(6), 1053\u20131060 (2016)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"2","key":"354_CR48","doi-asserted-by":"publisher","first-page":"237","DOI":"10.7155\/jgaa.00126","volume":"10","author":"I Safro","year":"2006","unstructured":"Safro, I., Ron, D., Brandt, A.: A multilevel algorithm for the minimum 2-sum problem. J. Graph Algorithms Appl. 10(2), 237\u2013258 (2006)","journal-title":"J. Graph Algorithms Appl."},{"key":"354_CR49","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2670338","volume":"19","author":"I Safro","year":"2015","unstructured":"Safro, I., Sanders, P., Schulz, C.: Advanced coarsening schemes for graph partitioning. J. Exp. Algorithm. 19, 2 (2015)","journal-title":"J. Exp. Algorithm."},{"key":"354_CR50","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schulz, C.: Engineering multilevel graph partitioning algorithms. In: European Symposium on Algorithms, pp. 469\u2013480. Springer (2011)","DOI":"10.1007\/978-3-642-23719-5_40"},{"issue":"6","key":"354_CR51","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/6.591665","volume":"34","author":"RR Schaller","year":"1997","unstructured":"Schaller, R.R.: Moore\u2019s law: past, present and future. IEEE Spectr. 34(6), 52\u201359 (1997)","journal-title":"IEEE Spectr."},{"key":"354_CR52","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1038\/nature04701","volume":"440","author":"E Schneidman","year":"2006","unstructured":"Schneidman, E., Berry, M., II., Segev, R., Bialek, W.: Weak pairwise correlations imply strongly correlated network states in a neural population. Nature 440, 1007\u201312 (2006). https:\/\/doi.org\/10.1038\/nature04701","journal-title":"Nature"},{"key":"354_CR53","unstructured":"Selby, A.: Efficient subgraph-based sampling of ising-type models with frustration. arXiv preprint arXiv:1409.3934 (2014)"},{"issue":"1","key":"354_CR54","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1137\/17M1152735","volume":"17","author":"R Shaydulin","year":"2019","unstructured":"Shaydulin, R., Chen, J., Safro, I.: Relaxation-based coarsening for multilevel hypergraph partitioning. Multiscale Model. Simul. 17(1), 482\u2013506 (2019)","journal-title":"Multiscale Model. Simul."},{"issue":"6","key":"354_CR55","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MC.2019.2908942","volume":"52","author":"R Shaydulin","year":"2019","unstructured":"Shaydulin, R., Ushijima-Mwesigwa, H., Negre, C.F., Safro, I., Mniszewski, S.M., Alexeev, Y.: A hybrid approach for solving optimization problems on small quantum computers. Computer 52(6), 18\u201326 (2019)","journal-title":"Computer"},{"key":"354_CR56","unstructured":"Shaydulin, R., Ushijima-Mwesigwa, H., Safro, I., Mniszewski, S., Alexeev, Y.: Community detection across emerging quantum architectures. In: 3rd International Workshop on Post Moore\u2019s Era Supercomputing (PMES 2018) (2018)"},{"issue":"9","key":"354_CR57","doi-asserted-by":"publisher","first-page":"1900029","DOI":"10.1002\/qute.201900029","volume":"2","author":"R Shaydulin","year":"2019","unstructured":"Shaydulin, R., Ushijima-Mwesigwa, H., Safro, I., Mniszewski, S., Alexeev, Y.: Network community detection on small quantum computers. Adv. Quantum Technol. 2(9), 1900029 (2019)","journal-title":"Adv. Quantum Technol."},{"issue":"21","key":"354_CR58","doi-asserted-by":"publisher","first-page":"2607","DOI":"10.1103\/PhysRevLett.57.2607","volume":"57","author":"RH Swendsen","year":"1986","unstructured":"Swendsen, R.H., Wang, J.S.: Replica Monte Carlo simulation of spin-glasses. Phys. Rev. Lett. 57(21), 2607 (1986)","journal-title":"Phys. Rev. Lett."},{"key":"354_CR59","doi-asserted-by":"crossref","unstructured":"Terry, J.P., Akrobotu, P.D., Negre, C.F., Mniszewski, S.M.: Quantum isomer search. arXiv preprint arXiv:1908.00542 (2019)","DOI":"10.1371\/journal.pone.0226787"},{"key":"354_CR60","doi-asserted-by":"crossref","unstructured":"Ushijima-Mwesigwa, H., Negre, C.F., Mniszewski, S.M.: Graph partitioning using quantum annealing on the d-wave system. In: Proceedings of the Second International Workshop on Post Moores Era Supercomputing, pp. 22\u201329. ACM (2017)","DOI":"10.1145\/3149526.3149531"},{"key":"354_CR61","doi-asserted-by":"crossref","unstructured":"Ushijima-Mwesigwa, H., Shaydulin, R., Negre, C.F., Mniszewski, S.M., Alexeev, Y., Safro, I.: Multilevel combinatorial optimization across quantum architectures. Accepted in ACM Transactions on Quantum Computing, preprint at arXiv:1910.09985 (2020)","DOI":"10.1145\/3425607"},{"issue":"3","key":"354_CR62","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.ejor.2012.07.012","volume":"223","author":"Y Wang","year":"2012","unstructured":"Wang, Y., L\u00fc, Z., Glover, F., Hao, J.K.: Path relinking for unconstrained binary quadratic programming. Eur. J. Oper. Res. 223(3), 595\u2013604 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"354_CR63","doi-asserted-by":"crossref","unstructured":"Yamaoka, M., Yoshimura, C., Hayashi, M., Okuyama, T., Aoki, H., Mizuno, H.: 24.3 20k-spin ising chip for combinational optimization problem with CMOS annealing. In: 2015 IEEE International Solid-State Circuits Conference-(ISSCC) Digest of Technical Papers, pp. 1\u20133. IEEE (2015)","DOI":"10.1109\/ISSCC.2015.7063111"},{"key":"354_CR64","doi-asserted-by":"crossref","unstructured":"Yoshimura, C., Yamaoka, M., Aoki, H., Mizuno, H.: Spatial computing architecture using randomness of memory cell stability under voltage control. In: 2013 European Conference on Circuit Theory and Design (ECCTD), pp. 1\u20134. IEEE (2013)","DOI":"10.1109\/ECCTD.2013.6662276"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00354-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00354-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00354-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T12:07:27Z","timestamp":1649506047000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00354-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,21]]},"references-count":64,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["354"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00354-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2022,2,21]]},"assertion":[{"value":"26 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}