{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T05:10:33Z","timestamp":1778217033177,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T00:00:00Z","timestamp":1778198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T00:00:00Z","timestamp":1778198400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62402191"],"award-info":[{"award-number":["62402191"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Innovation Program for Quantum Science and Technology","award":["2024ZD0300500"],"award-info":[{"award-number":["2024ZD0300500"]}]},{"name":"Interdisciplinary Research Program of Hust","award":["5003300129"],"award-info":[{"award-number":["5003300129"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08533-2","type":"journal-article","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:31:41Z","timestamp":1778214701000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A reduction framework with an improved beam search algorithm for non-slicing VLSI floorplanning"],"prefix":"10.1007","volume":"82","author":[{"given":"Canhui","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaozhong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhouxing","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingyun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junwen","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,8]]},"reference":[{"key":"8533_CR1","doi-asserted-by":"crossref","unstructured":"Lee W-P, Liu H-Y, Chang Y-W (2006) Voltage island aware floor planning for power and timing optimization. In: Proceedings of the 2006 IEEE\/ACM International Conference on Computer-Aided Design, pp 389\u2013394","DOI":"10.1109\/ICCAD.2006.320063"},{"issue":"7","key":"8533_CR2","doi-asserted-by":"publisher","first-page":"9663","DOI":"10.1007\/s11227-023-05812-0","volume":"80","author":"S Dayasagar Chowdary","year":"2024","unstructured":"Dayasagar Chowdary S, Sudhakar M (2024) Linear programming-based multi-objective floorplanning optimization for system-on-chip. J Supercomput 80(7):9663\u20139686. https:\/\/doi.org\/10.1007\/s11227-023-05812-0","journal-title":"J Supercomput"},{"key":"8533_CR3","doi-asserted-by":"crossref","unstructured":"Lai M, Wong D (2001) Slicing tree is a complete floorplan representation. In: Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001, IEEE, pp 228\u2013232","DOI":"10.1109\/DATE.2001.915030"},{"key":"8533_CR4","doi-asserted-by":"crossref","unstructured":"Chan HH, Markov IL (2004) Practical slicing and non-slicing block-packing without simulated annealing. In: Proceedings of the 14th ACM Great Lakes Symposium on VLSI, pp 282\u2013287","DOI":"10.1145\/988952.989020"},{"key":"8533_CR5","doi-asserted-by":"crossref","unstructured":"Adya SN, Markov IL (2001) Fixed-outline floorplanning through better local search. In: Proceedings 2001 IEEE International Conference on Computer Design: VLSI in Computers and Processors. ICCD 2001, IEEE, pp 328\u2013334","DOI":"10.1109\/ICCD.2001.955047"},{"key":"8533_CR6","doi-asserted-by":"crossref","unstructured":"Wong D, Liu C (1986) A new algorithm for floorplan design. In: 23rd ACM\/IEEE Design Automation Conference, IEEE, pp 101\u2013107","DOI":"10.1109\/DAC.1986.1586075"},{"key":"8533_CR7","doi-asserted-by":"crossref","unstructured":"Young FY, Wong D (1998) Slicing floorplans with pre-placed modules. In: Proceedings of International Conference on Computer-Aided Design, pp 252\u2013258","DOI":"10.1145\/288548.288622"},{"key":"8533_CR8","doi-asserted-by":"crossref","unstructured":"Guo P-N, Cheng C-K, Yoshimura T (1999) An O-tree representation of non-slicing floorplan and its applications. In: Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361), pp 268\u2013273","DOI":"10.1145\/309847.309928"},{"key":"8533_CR9","doi-asserted-by":"publisher","unstructured":"Chang Y-C, Chang Y-W, Wu G-M, Wu S-W (2000) B*-trees: a new representation for non-slicing floorplans. In: Proceedings 37th Design Automation Conference, pp 458\u2013463. https:\/\/doi.org\/10.1109\/DAC.2000.855354","DOI":"10.1109\/DAC.2000.855354"},{"key":"8533_CR10","doi-asserted-by":"crossref","unstructured":"Lin J-M, Hung Z-X (2011) Skb-tree: a fixed-outline driven representation for modern floorplanning problems. IEEE Trans Very Large Scale Integr (VLSI) Syst 20(3):473\u2013484","DOI":"10.1109\/TVLSI.2011.2104983"},{"key":"8533_CR11","doi-asserted-by":"crossref","unstructured":"Ma Y, Dong S, Hong X, Cai Y, Cheng C-K, Gu J (2001) VLSI floorplanning with boundary constraints based on corner block list. In: Proceedings of the 2001 Asia and South Pacific Design Automation Conference, pp 509\u2013514","DOI":"10.1145\/370155.370521"},{"key":"8533_CR12","doi-asserted-by":"crossref","unstructured":"Lin J-M, Chang Y-W (2001) TCG: a transitive closure graph-based representation for non-slicing floorplans. In: Proceedings of the 38th Annual Design Automation Conference, pp 764\u2013769","DOI":"10.1145\/378239.379062"},{"key":"8533_CR13","doi-asserted-by":"crossref","unstructured":"Tang X, Wong D (2001) FAST-SP: a fast algorithm for block placement based on sequence pair. In: Proceedings of the 2001 Asia and South Pacific Design Automation Conference, pp 521\u2013526","DOI":"10.1145\/370155.370523"},{"issue":"2","key":"8533_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0167-9260(99)00015-2","volume":"28","author":"B-H Gwee","year":"1999","unstructured":"Gwee B-H, Lim M-H (1999) A GA with heuristic-based decoder for ic floorplanning. Integration 28(2):157\u2013172","journal-title":"Integration"},{"key":"8533_CR15","doi-asserted-by":"publisher","first-page":"50911","DOI":"10.1109\/ACCESS.2020.2980135","volume":"8","author":"Z Huang","year":"2020","unstructured":"Huang Z, Lin Z, Zhu Z, Chen J (2020) An improved simulated annealing algorithm with excessive length penalty for fixed-outline floorplanning. IEEE Access 8:50911\u201350920","journal-title":"IEEE Access"},{"key":"8533_CR16","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.asoc.2015.10.045","volume":"40","author":"Q Xu","year":"2016","unstructured":"Xu Q, Chen S, Li B (2016) Combining the ant system algorithm and simulated annealing for 3D\/2D fixed-outline floorplanning. Appl Soft Comput 40:150\u2013160","journal-title":"Appl Soft Comput"},{"key":"8533_CR17","doi-asserted-by":"crossref","unstructured":"Chen J, Zhu W, Ali MM (2010) A hybrid simulated annealing algorithm for nonslicing VLSI floorplanning. IEEE Trans Syst Man Cybern Part C (Appl Rev) 41(4):544\u2013553","DOI":"10.1109\/TSMCC.2010.2066560"},{"issue":"3","key":"8533_CR18","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s10589-011-9442-y","volume":"52","author":"S Anand","year":"2012","unstructured":"Anand S, Saravanasankar S, Subbaraj P (2012) Customized simulated annealing based decision algorithms for combinatorial optimization in VLSI floorplanning problem. Comput Optim Appl 52(3):667\u2013689","journal-title":"Comput Optim Appl"},{"key":"8533_CR19","doi-asserted-by":"crossref","unstructured":"Tang M, Sebastian A (2005) A genetic algorithm for VLSI floorplanning using o-tree representation. In: Applications of Evolutionary Computing, 2005 Proceedings, Springer, pp 215\u2013224","DOI":"10.1007\/978-3-540-32003-6_22"},{"issue":"12","key":"8533_CR20","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1007\/s00500-009-0501-6","volume":"14","author":"G Chen","year":"2010","unstructured":"Chen G, Guo W, Chen Y (2010) A PSO-based intelligent decision algorithm for VLSI floorplanning. Soft Comput 14(12):1329\u20131337","journal-title":"Soft Comput"},{"key":"8533_CR21","doi-asserted-by":"crossref","unstructured":"Chen J, Chen G, Guo W (2009) A discrete pso for multi-objective optimization in VLSI floorplanning. In: Advances in Computation and Intelligence: 4th International Symposium, Springer, pp 400\u2013410","DOI":"10.1007\/978-3-642-04843-2_43"},{"issue":"11","key":"8533_CR22","doi-asserted-by":"publisher","first-page":"3521","DOI":"10.1007\/s00034-015-0020-x","volume":"34","author":"P Sivaranjani","year":"2015","unstructured":"Sivaranjani P, Senthil Kumar A (2015) Thermal-aware non-slicing VLSI floorplanning using a smart decision-making pso-ga based hybrid algorithm. Circuits Syst Signal Process 34(11):3521\u20133542","journal-title":"Circuits Syst Signal Process"},{"key":"8533_CR23","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.vlsi.2017.03.006","volume":"58","author":"J Chen","year":"2017","unstructured":"Chen J, Liu Y, Zhu Z, Zhu W (2017) An adaptive hybrid memetic algorithm for thermal-aware non-slicing VLSI floorplanning. Integration 58:245\u2013252","journal-title":"Integration"},{"issue":"14","key":"8533_CR24","doi-asserted-by":"publisher","first-page":"15496","DOI":"10.1007\/s11227-023-05277-1","volume":"79","author":"L Jiang","year":"2023","unstructured":"Jiang L, Ouyang D, Zhou H, Tian N, Zhang L (2023) DPAHMA: a novel dual-population adaptive hybrid memetic algorithm for non-slicing vlsi floorplans. J Supercomput 79(14):15496\u201315534. https:\/\/doi.org\/10.1007\/s11227-023-05277-1","journal-title":"J Supercomput"},{"key":"8533_CR25","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.vlsi.2022.04.001","volume":"86","author":"J Shanthi","year":"2022","unstructured":"Shanthi J, Rani DGN, Rajaram S (2022) An enhanced memetic algorithm using skb tree representation for fixed-outline and temperature driven non-slicing floorplanning. Integration 86:84\u201397","journal-title":"Integration"},{"issue":"7","key":"8533_CR26","doi-asserted-by":"publisher","first-page":"3285","DOI":"10.1016\/j.asoc.2013.02.011","volume":"13","author":"C-S Hoo","year":"2013","unstructured":"Hoo C-S, Jeevan K, Ganapathy V, Ramiah H (2013) Variable-order ant system for VLSI multiobjective floorplanning. Appl Soft Comput 13(7):3285\u20133297","journal-title":"Appl Soft Comput"},{"issue":"1","key":"8533_CR27","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10470-020-01598-w","volume":"103","author":"M Shunmugathammal","year":"2020","unstructured":"Shunmugathammal M, Columbus CC, Anand S (2020) A nature inspired optimization algorithm for VLSI fixed-outline floorplanning. Analog Integr Circ Sig Process 103(1):173\u2013186","journal-title":"Analog Integr Circ Sig Process"},{"issue":"3","key":"8533_CR28","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/TCAD.2010.2041850","volume":"29","author":"JZ Yan","year":"2010","unstructured":"Yan JZ, Chu C (2010) Defer: deferred decision making enabled fixed-outline floorplanning algorithm. IEEE Trans Comput Aided Des Integr Circuits Syst 29(3):367\u2013381","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"8533_CR29","doi-asserted-by":"crossref","unstructured":"He Z, Ma Y, Zhang L, Liao P, Wong N, Yu B, Wong MD (2020) Learn to floorplan through acquisition of effective local search heuristics. In: 2020 IEEE 38th International Conference on Computer Design, IEEE, pp 324\u2013331","DOI":"10.1109\/ICCD50377.2020.00061"},{"key":"8533_CR30","doi-asserted-by":"crossref","unstructured":"Liu K, Gu J, Gu H, Zhu Z (2023) A hybrid reinforcement learning and genetic algorithm for VLSI floorplanning. In: Proceedings of the 2023 15th International Conference on Machine Learning and Computing, pp 412\u2013418","DOI":"10.1145\/3587716.3587785"},{"issue":"1","key":"8533_CR31","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.ejor.2004.02.020","volume":"167","author":"S Imahori","year":"2005","unstructured":"Imahori S, Yagiura M, Ibaraki T (2005) Improved local search algorithms for the rectangle packing problem with general spatial costs. Eur J Oper Res 167(1):48\u201367","journal-title":"Eur J Oper Res"},{"issue":"5","key":"8533_CR32","first-page":"734","volume":"29","author":"W Huang","year":"2006","unstructured":"Huang W, Liu J-F (2006) A deterministic heuristic algorithm based on Euclidian distance for solving the rectangles packing problem. Chin J Comput 29(5):734","journal-title":"Chin J Comput"},{"issue":"7","key":"8533_CR33","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1016\/j.cor.2011.08.005","volume":"39","author":"K He","year":"2012","unstructured":"He K, Huang W, Jin Y (2012) An efficient deterministic heuristic for two-dimensional rectangular packing. Comput Oper Res 39(7):1355\u20131363","journal-title":"Comput Oper Res"},{"issue":"4","key":"8533_CR34","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"EK Burke","year":"2004","unstructured":"Burke EK, Kendall G, Whitwell G (2004) A new placement heuristic for the orthogonal stock-cutting problem. Oper Res 52(4):655\u2013671","journal-title":"Oper Res"},{"issue":"3","key":"8533_CR35","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1016\/j.ejor.2014.09.042","volume":"241","author":"K He","year":"2015","unstructured":"He K, Ji P, Li C (2015) Dynamic reduction heuristics for the rectangle packing area minimization problem. Eur J Oper Res 241(3):674\u2013685","journal-title":"Eur J Oper Res"},{"key":"8533_CR36","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.omega.2017.09.002","volume":"80","author":"L Wei","year":"2018","unstructured":"Wei L, Zhu W, Lim A, Liu Q, Chen X (2018) An adaptive selection approach for the 2d rectangle packing area minimization problem. Omega 80:22\u201330","journal-title":"Omega"},{"issue":"1","key":"8533_CR37","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/00207548808947840","volume":"26","author":"PS Ow","year":"1988","unstructured":"Ow PS, Morton TE (1988) Filtered beam search in scheduling. Int J Prod Res 26(1):35\u201362","journal-title":"Int J Prod Res"},{"key":"8533_CR38","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1007\/s00034-019-01054-9","volume":"39","author":"M Shunmugathammal","year":"2020","unstructured":"Shunmugathammal M, Christopher Columbus C, Anand S (2020) A novel B* tree crossover-based simulated annealing algorithm for combinatorial optimization in VLSI fixed-outline floorplans. Circuits Syst Signal Process 39:900\u2013918","journal-title":"Circuits Syst Signal Process"},{"issue":"2","key":"8533_CR39","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.ejor.2011.06.022","volume":"215","author":"L Wei","year":"2011","unstructured":"Wei L, Oon W-C, Zhu W, Lim A (2011) A skyline heuristic for the 2d rectangular packing and strip packing problems. Eur J Oper Res 215(2):337\u2013346. https:\/\/doi.org\/10.1016\/j.ejor.2011.06.022","journal-title":"Eur J Oper Res"},{"issue":"3","key":"8533_CR40","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.ejor.2012.08.006","volume":"224","author":"A Bortfeldt","year":"2013","unstructured":"Bortfeldt A (2013) A reduction approach for solving the rectangle packing area minimization problem. Eur J Oper Res 224(3):486\u2013496","journal-title":"Eur J Oper Res"},{"issue":"10","key":"8533_CR41","doi-asserted-by":"publisher","first-page":"3699","DOI":"10.1109\/TCYB.2018.2848116","volume":"49","author":"Y Zhou","year":"2018","unstructured":"Zhou Y, Hao J-K, Glover F (2018) Memetic search for identifying critical nodes in sparse graphs. IEEE Trans Cybern 49(10):3699\u20133712","journal-title":"IEEE Trans Cybern"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08533-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08533-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08533-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:32:06Z","timestamp":1778214726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08533-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,8]]},"references-count":41,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2026,5]]}},"alternative-id":["8533"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08533-2","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,8]]},"assertion":[{"value":"24 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2026","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"402"}}