{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T04:06:52Z","timestamp":1730347612707,"version":"3.28.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T00:00:00Z","timestamp":1696464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T00:00:00Z","timestamp":1696464000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Fujitsu Ltd."},{"name":"Fujitsu Consulting (Canada) Inc."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11222-023-10300-9","type":"journal-article","created":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T17:02:09Z","timestamp":1696525329000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimization via Rejection-Free Partial Neighbor Search"],"prefix":"10.1007","volume":"33","author":[{"given":"Sigeng","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jeffrey S.","family":"Rosenthal","sequence":"additional","affiliation":[]},{"given":"Aki","family":"Dote","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Tamura","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Sheikholeslami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,5]]},"reference":[{"issue":"1","key":"10300_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/07468342.2007.11922216","volume":"38","author":"B Albright","year":"2007","unstructured":"Albright, B.: An introduction to simulated annealing. Coll. Math. J. 38(1), 37\u201342 (2007)","journal-title":"Coll. Math. J."},{"issue":"1","key":"10300_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/5992.814660","volume":"2","author":"I Beichl","year":"2000","unstructured":"Beichl, I., Sullivan, F.: The Metropolis algorithm. Comput. Sci. Eng. 2(1), 65\u201369 (2000)","journal-title":"Comput. Sci. Eng."},{"issue":"1","key":"10300_CR3","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1214\/ss\/1177011077","volume":"8","author":"D Bertsimas","year":"1993","unstructured":"Bertsimas, D., Tsitsiklis, J.: Simulated annealing. Stat. Sci. 8(1), 10\u201315 (1993)","journal-title":"Stat. Sci."},{"issue":"2","key":"10300_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","volume":"8","author":"L Bianchi","year":"2009","unstructured":"Bianchi, L., Dorigo, M., Gambardella, L.M., et al.: A survey on metaheuristics for stochastic combinatorial optimization. Nat. Comput. 8(2), 239\u2013287 (2009)","journal-title":"Nat. Comput."},{"issue":"6","key":"10300_CR5","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1007\/s11222-015-9598-x","volume":"26","author":"J Bierkens","year":"2016","unstructured":"Bierkens, J.: Non-reversible metropolis-hastings. Stat. Comput. 26(6), 1213\u20131228 (2016)","journal-title":"Stat. Comput."},{"issue":"1","key":"10300_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1140\/epjst\/e2012-01642-y","volume":"210","author":"B Block","year":"2012","unstructured":"Block, B., Preis, T.: Computer simulations of the Ising model on graphics processing units. Eur. Phys. J. Spec. Top. 210(1), 133\u2013145 (2012)","journal-title":"Eur. Phys. J. Spec. Top."},{"doi-asserted-by":"crossref","unstructured":"Chen, S., Rosenthal, JS., Dote, A., et\u00a0al.: Sampling via rejection-free partial neighbor search (2022). arXiv preprint arXiv:2210.10513","key":"10300_CR7","DOI":"10.1080\/03610918.2023.2266157"},{"issue":"10","key":"10300_CR8","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1080\/00029890.1987.12000742","volume":"94","author":"BA Cipra","year":"1987","unstructured":"Cipra, B.A.: An introduction to the Ising model. Am. Math. Mon. 94(10), 937\u2013959 (1987)","journal-title":"Am. Math. Mon."},{"issue":"6","key":"10300_CR9","first-page":"1","volume":"33","author":"BA Cipra","year":"2000","unstructured":"Cipra, B.A.: The Ising model is NP-complete. SIAM News 33(6), 1\u20133 (2000)","journal-title":"SIAM News"},{"issue":"1","key":"10300_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1214\/10-AOS838","volume":"39","author":"R Douc","year":"2011","unstructured":"Douc, R., Robert, C.P.: A vanilla Rao-Blackwellization of Metropolis-Hastings algorithms. Ann. Stat. 39(1), 261\u2013277 (2011)","journal-title":"Ann. Stat."},{"key":"10300_CR11","first-page":"1538","volume-title":"Encyclopedia of Optimization","author":"CA Floudas","year":"2008","unstructured":"Floudas, C.A., Pardalos, P.M.: Encyclopedia of Optimization, pp. 1538\u20131542. Springer, Berlin (2008)"},{"doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47\u201363 (1974)","key":"10300_CR12","DOI":"10.1145\/800119.803884"},{"issue":"3","key":"10300_CR13","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search-part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"10300_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search-part II. ORSA J. Comput. 2(1), 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"unstructured":"Glover, F., Kochenberger, G., Du, Y.: A tutorial on formulating and using QUBO models (2018). arXiv:1811.11538","key":"10300_CR15"},{"issue":"011","key":"10300_CR16","first-page":"003","volume":"12","author":"I Hen","year":"2019","unstructured":"Hen, I.: Equation planting: a tool for benchmarking Ising machines. Phys. Rev. Appl. 12(011), 003 (2019)","journal-title":"Phys. Rev. Appl."},{"issue":"2","key":"10300_CR17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1080\/00031305.1998.10480559","volume":"52","author":"JL Hintze","year":"1998","unstructured":"Hintze, J.L., Nelson, R.D.: Violin plots: a box plot-density trace synergism. Am. Stat. 52(2), 181\u2013184 (1998)","journal-title":"Am. Stat."},{"issue":"4","key":"10300_CR18","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1198\/0003130032413","volume":"57","author":"DB Hitchcock","year":"2003","unstructured":"Hitchcock, D.B.: A history of the Metropolis-Hastings algorithm. Am. Stat. 57(4), 254\u2013257 (2003)","journal-title":"Am. Stat."},{"issue":"8","key":"10300_CR19","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"JJ Hopfield","year":"1982","unstructured":"Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. 79(8), 2554\u20132558 (1982)","journal-title":"Proc. Natl. Acad. Sci."},{"doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","key":"10300_CR20","DOI":"10.1126\/science.220.4598.671"},{"issue":"1","key":"10300_CR21","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., Hao, J.K., Glover, F., et al.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58\u201381 (2014)","journal-title":"J. Comb. Optim."},{"unstructured":"Ma, Y.P., Sudakov, I., Strong, C., et\u00a0al.: Ising model for melt ponds on Arctic sea ice. (2014). arXiv:1408.2487","key":"10300_CR22"},{"doi-asserted-by":"crossref","unstructured":"Matsubara, S., Takatsu, M., Miyazawa, T., et\u00a0al.: Digital annealer for high-speed solving of combinatorial optimization problems and its applications. In: 2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 667\u2013672 (2020)","key":"10300_CR23","DOI":"10.1109\/ASP-DAC47756.2020.9045100"},{"issue":"6","key":"10300_CR24","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., et al.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"unstructured":"Neal, R.M.: Improving asymptotic variance of MCMC estimators: non-reversible chains are better. arXiv preprint arXiv:math\/0407281 (2004)","key":"10300_CR25"},{"doi-asserted-by":"crossref","unstructured":"Nikolaev, A.G., Jacobson, S.H.: Simulated annealing. Handbook of metaheuristics, pp. 1\u201339 (2010)","key":"10300_CR26","DOI":"10.1007\/978-1-4419-1665-5_1"},{"issue":"4","key":"10300_CR27","doi-asserted-by":"publisher","first-page":"2789","DOI":"10.1007\/s00180-021-01095-2","volume":"36","author":"JS Rosenthal","year":"2021","unstructured":"Rosenthal, J.S., Dote, A., Dabiri, K., et al.: Jump Markov chains and rejection-free Metropolis algorithms. Comput. Stat. 36(4), 2789\u20132811 (2021)","journal-title":"Comput. Stat."},{"issue":"1","key":"10300_CR28","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/101.17235","volume":"5","author":"RA Rutenbar","year":"1989","unstructured":"Rutenbar, R.A.: Simulated annealing algorithms: an overview. IEEE Circuits Devices Mag. 5(1), 19\u201326 (1989)","journal-title":"IEEE Circuits Devices Mag."},{"issue":"4","key":"10300_CR29","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S Sahni","year":"1974","unstructured":"Sahni, S.: Computationally related problems. SIAM J. Comput. 3(4), 262\u2013279 (1974)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10300_CR30","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1002\/nav.3800220110","volume":"22","author":"HM Salkin","year":"1975","unstructured":"Salkin, H.M., De Kluyver, C.A.: The knapsack problem: a survey. Naval Res. Logist. Q. 22(1), 127\u2013144 (1975)","journal-title":"Naval Res. Logist. Q."},{"key":"10300_CR31","first-page":"1","volume":"12","author":"A Schrijver","year":"2005","unstructured":"Schrijver, A.: On the history of combinatorial optimization (till 1960). Handb. Oper. Res. Manag. Sci. 12, 1\u201368 (2005)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"doi-asserted-by":"crossref","unstructured":"Sheikholeslami, A.: The power of parallelism in stochastic search for global optimum: Keynote paper. In: ESSCIRC 2021\u2014IEEE 47th European Solid State Circuits Conference (ESSCIRC), pp. 36\u201342 (2021)","key":"10300_CR32","DOI":"10.1109\/ESSCIRC53450.2021.9567809"},{"issue":"3","key":"10300_CR33","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MC.2010.75","volume":"43","author":"AC Sodan","year":"2010","unstructured":"Sodan, A.C., Machina, J., Deshmeh, A., et al.: Parallelism via multithreaded and multicore CPUs. Computer 43(3), 24\u201332 (2010)","journal-title":"Computer"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-023-10300-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-023-10300-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-023-10300-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T03:38:20Z","timestamp":1730259500000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-023-10300-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,5]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["10300"],"URL":"https:\/\/doi.org\/10.1007\/s11222-023-10300-9","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"type":"print","value":"0960-3174"},{"type":"electronic","value":"1573-1375"}],"subject":[],"published":{"date-parts":[[2023,10,5]]},"assertion":[{"value":"30 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"131"}}