{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:22:58Z","timestamp":1740169378671,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3485675","type":"journal-article","created":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T17:28:48Z","timestamp":1729790928000},"page":"156627-156638","source":"Crossref","is-referenced-by-count":0,"title":["QUBO Formulation Using Sequence Pair With Search Space Restriction for Rectangle Packing Problem"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8357-1284","authenticated-orcid":false,"given":"Akihisa","family":"Okada","sequence":"first","affiliation":[{"name":"Toyota Central Research and Development Laboratories, Inc., Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9431-0867","authenticated-orcid":false,"given":"Keisuke","family":"Otaki","sequence":"additional","affiliation":[{"name":"Toyota Central Research and Development Laboratories, Inc., Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9597-0285","authenticated-orcid":false,"given":"Tadayoshi","family":"Matsumori","sequence":"additional","affiliation":[{"name":"Toyota Central Research and Development Laboratories, Inc., Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7283-8617","authenticated-orcid":false,"given":"Hiroaki","family":"Yoshida","sequence":"additional","affiliation":[{"name":"Toyota Central Research and Development Laboratories, Inc., Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kotaro","family":"Terada","sequence":"additional","affiliation":[{"name":"Green Computing Systems Research Organization, Waseda University, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3400-3587","authenticated-orcid":false,"given":"Nozomu","family":"Togawa","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Communications Engineering, Waseda University, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/isscc.2015.7063111"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/fpl.2019.00019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/asp-dac47756.2020.9045100"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ac8c54"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2023.1150921"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3271969"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3389\/fcomp.2019.00009"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3389\/fcomp.2019.00002"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3114543"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/QCE52317.2021.00019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-021-82740-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.013319"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-16149-8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-14735-4"},{"issue":"2","key":"ref16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","article-title":"Two-dimensional packing problems: A survey","volume":"141","author":"Lodi","year":"2002","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"ref17","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(96)00359-1","article-title":"4-block heuristic for the rectangle packing problem","volume":"108","author":"Scheithauer","year":"1998","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"ref18","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1016\/j.simpat.2007.09.004","article-title":"An efficient heuristic algorithm for rectangle-packing problem","volume":"15","author":"Huang","year":"2007","journal-title":"Simul. Model. Pract. Theory"},{"issue":"5","key":"ref19","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1016\/j.cor.2008.03.004","article-title":"A least wasted first heuristic algorithm for the rectangular packing problem","volume":"36","author":"Wei","year":"2009","journal-title":"Comput. Operations Res."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-39013-9"},{"issue":"8","key":"ref21","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1016\/j.cor.2005.01.009","article-title":"A new heuristic recursive algorithm for the strip rectangular packing problem","volume":"33","author":"Zhang","year":"2006","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"ref22","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2008.08.020","article-title":"Exact algorithms for the two-dimensional strip packing problem with and without rotations","volume":"198","author":"Kenmochi","year":"2009","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"ref23","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1016\/j.cor.2007.12.004","article-title":"Heuristic approaches for the two{-} and three-dimensional knapsack packing problem","volume":"36","author":"Egeblad","year":"2009","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"ref24","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1016\/j.ejor.2005.11.062","article-title":"A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem","volume":"183","author":"Gon\u00e7alves","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0427-1"},{"issue":"1","key":"ref26","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.ejor.2004.02.020","article-title":"Improved local search algorithms for the rectangle packing problem with general spatial costs","volume":"167","author":"Imahori","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/127601.127708"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/988952.989020"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0463-6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3735"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/43.552084"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/MIPRO.2015.7160455"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MIPRO.2016.7522344"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/VLSI-DAT.2018.8373233"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3081685"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10734100.pdf?arnumber=10734100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T06:11:43Z","timestamp":1732687903000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10734100\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3485675","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}