{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:14:42Z","timestamp":1760710482205,"version":"3.37.3"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s00291-021-00619-y","type":"journal-article","created":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T03:24:35Z","timestamp":1612927475000},"page":"467-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The effect of benchmark data characteristics during empirical strip packing heuristic performance evaluation"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1672-2695","authenticated-orcid":false,"given":"Rosephine G.","family":"Rakotonirainy","sequence":"first","affiliation":[]},{"given":"Jan H.","family":"van Vuuren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,9]]},"reference":[{"key":"619_CR1","doi-asserted-by":"crossref","DOI":"10.1201\/b15410","volume-title":"Data clustering: algorithms and applications","author":"CC Aggarwal","year":"2013","unstructured":"Aggarwal CC, Reddy CK (2013) Data clustering: algorithms and applications. CRC Press, New York (NY)"},{"key":"619_CR2","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1057\/palgrave.jors.2601829","volume":"56","author":"R Alvarez-Valdes","year":"2005","unstructured":"Alvarez-Valdes R, Parreno F, Tamarit JM (2005) A grasp algorithm for constrained two-dimensional non-guillotine cutting problems. J Oper Res Soc 56:414\u2013425","journal-title":"J Oper Res Soc"},{"key":"619_CR3","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","volume":"35","author":"R Alvarez-Vald\u00e9s","year":"2008","unstructured":"Alvarez-Vald\u00e9s R, Parre\u00f1o F, Tamarit JM (2008) Reactive grasp for the strip-packing problem. Comput Oper Res 35:1065\u20131083","journal-title":"Comput Oper Res"},{"key":"619_CR4","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1080\/002075499191166","volume":"37","author":"AR Babu","year":"1999","unstructured":"Babu AR, Babu NR (1999) Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. Int J Prod Res 37:1625\u20131643","journal-title":"Int J Prod Res"},{"key":"619_CR5","unstructured":"Bach FR, Jordan MI (2004) Learning spectral clustering. In: Advances in neural information processing systems, pp 305\u2013312"},{"key":"619_CR6","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"BS Baker","year":"1980","unstructured":"Baker BS, Coffman EG Jr, Rivest RL (1980) Orthogonal packings in two dimensions. SIAM J Comput 9:846\u2013855","journal-title":"SIAM J Comput"},{"key":"619_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1057\/jors.1985.51","volume":"36","author":"J Beasley","year":"1985","unstructured":"Beasley J (1985a) Algorithms for unconstrained two-dimensional guillotine cutting. J Oper Res Soc 36:297\u2013306","journal-title":"J Oper Res Soc"},{"key":"619_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"J Beasley","year":"1985","unstructured":"Beasley J (1985b) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33:49\u201364","journal-title":"Oper Res"},{"key":"619_CR9","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1057\/palgrave.jors.2602393","volume":"59","author":"G Belov","year":"2008","unstructured":"Belov G, Scheithauer G, Mukhacheva E (2008) One-dimensional heuristics adapted for two-dimensional rectangular strip packing. J Oper Res Soc 59:823\u2013832","journal-title":"J Oper Res Soc"},{"key":"619_CR10","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1093\/comjnl\/25.3.353","volume":"25","author":"B Bengtsson","year":"1982","unstructured":"Bengtsson B (1982) Packing rectangular pieces\u2014a heuristic approach. Comput J 25:353\u2013357","journal-title":"Comput J"},{"key":"619_CR11","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"J Berkey","year":"1987","unstructured":"Berkey J, Wang P (1987) Two-dimensional finite bin-packing algorithms. J Oper Res Soc 38:423\u2013429","journal-title":"J Oper Res Soc"},{"key":"619_CR12","unstructured":"Bologna ORG (2017) Library of instances. http:\/\/or.dei.unibo.it\/library\/two-dimensional-bin-packing-problem"},{"key":"619_CR13","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.ejor.2004.11.016","volume":"172","author":"A Bortfeldt","year":"2006","unstructured":"Bortfeldt A (2006) A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur J Oper Res 172:814\u2013837","journal-title":"Eur J Oper Res"},{"key":"619_CR14","doi-asserted-by":"crossref","unstructured":"Bortfeldt A, Gehring H (2006) New large benchmark instances for the two-dimensional strip packing problem with rectangular pieces. In: Annual Hawaii International Conference on System Sciences 39, p\u00a030). Kauai (HI)","DOI":"10.1109\/HICSS.2006.360"},{"key":"619_CR15","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"E Burke","year":"2004","unstructured":"Burke E, Kendall G, Whitwell G (2004) A new placement heuristic for the orthogonal stock-cutting problem. Oper Res 52:655\u2013671","journal-title":"Oper Res"},{"key":"619_CR16","doi-asserted-by":"crossref","unstructured":"Burke EK, Kendall G (1999) Applying simulated annealing and the no fit polygon to the nesting problem. In: World Manufacturing Congress, pp 27\u201330. Durham","DOI":"10.1007\/3-540-46695-9_38"},{"key":"619_CR17","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1287\/ijoc.1080.0306","volume":"21","author":"EK Burke","year":"2009","unstructured":"Burke EK, Kendall G, Whitwell G (2009) A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem. INFORMS J Comput 21:505\u2013516","journal-title":"INFORMS J Comput"},{"key":"619_CR18","doi-asserted-by":"crossref","unstructured":"Calinski T, Harabasz J (1974) A dendrite method for cluster analysis. Commun Stat-Theory Methods 3:1\u201327","DOI":"10.1080\/03610927408827101"},{"key":"619_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v061.i06","volume":"61","author":"M Charrad","year":"2014","unstructured":"Charrad M, Ghazzali N, Boiteau V, Niknafs A, Charrad MM (2014) Package nbclust. J Stat Softw 61:1\u201336","journal-title":"J Stat Softw"},{"key":"619_CR20","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1109\/TC.1983.1676307","volume":"100","author":"B Chazelle","year":"1983","unstructured":"Chazelle B (1983) The bottom-left bin-packing heuristic: an efficient implementation. Comput IEEE Trans Comput 100:697\u2013707","journal-title":"Comput IEEE Trans Comput"},{"key":"619_CR21","doi-asserted-by":"crossref","first-page":"72906","DOI":"10.1109\/ACCESS.2018.2882823","volume":"6","author":"Z Chen","year":"2018","unstructured":"Chen Z, Chen J (2018) An effective corner increment-based algorithm for the two-dimensional strip packing problem. IEEE Access 6:72906\u201372924","journal-title":"IEEE Access"},{"key":"619_CR22","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N Christofides","year":"1977","unstructured":"Christofides N, Whitlock C (1977) An algorithm for two-dimensional cutting problems. Oper Res 25:30\u201344","journal-title":"Oper Res"},{"key":"619_CR23","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/A:1018517106992","volume":"8","author":"C Dagli","year":"1997","unstructured":"Dagli C, Poshyanonda P (1997) New approaches to nesting rectangular patterns. J Intell Manuf 8:177\u2013190","journal-title":"J Intell Manuf"},{"key":"619_CR24","doi-asserted-by":"crossref","unstructured":"Davies DL, Bouldin DW (1979) A cluster separation measure. In: IEEE transactions on pattern analysis and machine intelligence, pp 224\u2013227","DOI":"10.1109\/TPAMI.1979.4766909"},{"key":"619_CR25","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1080\/01969727408546059","volume":"4","author":"JC Dunn","year":"1974","unstructured":"Dunn JC (1974) Well-separated clusters and optimal fuzzy partitions. J Cybern 4:95\u2013104","journal-title":"J Cybern"},{"key":"619_CR26","first-page":"123","volume":"6","author":"MT Elbatta","year":"2013","unstructured":"Elbatta MT, Ashour WM (2013) A dynamic method for discovering density varied clusters. Int J Signal Process Image Process Pattern Recognit 6:123\u2013134","journal-title":"Int J Signal Process Image Process Pattern Recognit"},{"key":"619_CR27","unstructured":"ESICUP (2015) Datasets 2d-rectangular. http:\/\/paginas.fe.up.pt\/~esicup\/datasets?category_id=3"},{"key":"619_CR28","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X, et\u00a0al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: $$2^{nd}$$ International Conference on Knowledge Discovery and Data Mining 34, pp 226\u2013231. Portland (OR)"},{"key":"619_CR29","unstructured":"Ferreira EP, Oliveira JF (2005) Algorithm based on graphs for the non-guillotinable two-dimensional packing problem. In: Proceedings of the $$2^{nd}$$ ESICUP Meeting, Southampton (p. none)"},{"key":"619_CR30","doi-asserted-by":"crossref","unstructured":"Halkidi M, Batistakis Y, Vazirgiannis M (2000) Quality scheme assessment in the clustering process. In: Principles of Data Mining and Knowledge Discovery. Springer, Berlin, pp 265\u2013276","DOI":"10.1007\/3-540-45372-5_26"},{"key":"619_CR31","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1012801612483","volume":"17","author":"M Halkidi","year":"2001","unstructured":"Halkidi M, Batistakis Y, Vazirgiannis M (2001) On clustering validation techniques. J Intell Inf Syst 17:107\u2013145","journal-title":"J Intell Inf Syst"},{"key":"619_CR32","unstructured":"Halkidi M, Vazirgiannis M (2001) Clustering validity assessment: finding the optimal partitioning of a data set. In: International conference on data mining, pp 187\u2013194. San Jose (CA)"},{"key":"619_CR33","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1016\/S0305-0548(98)00008-2","volume":"25","author":"M Hifi","year":"1998","unstructured":"Hifi M (1998) Exact algorithms for the guillotine strip cutting and packing problem. Comput Oper Res 25:925\u2013940","journal-title":"Comput Oper Res"},{"key":"619_CR34","first-page":"169","volume":"19","author":"M Hifi","year":"1999","unstructured":"Hifi M (1999) The strip cutting and packing problem: incremental substrip algorithms-based heuristics. Pesquisa Oper 19:169\u2013188","journal-title":"Pesquisa Oper"},{"key":"619_CR35","unstructured":"Hifi M (2004) Library of instances. ftp:\/\/cermsem.univ-paris1.fr\/pub\/CERMSEM\/hifi\/Strip-cutting\/"},{"key":"619_CR36","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E Hopper","year":"2001","unstructured":"Hopper E, Turton B (2001) An empirical investigation of meta-heuristic and heuristic algorithms for a 2d packing problem. Eur J Oper Res 128:34\u201357","journal-title":"Eur J Oper Res"},{"key":"619_CR37","first-page":"123","volume":"2","author":"E Hopper","year":"2002","unstructured":"Hopper E, Turton B (2002) Problem generators for rectangular packing problems. Stud Inf Univ 2:123\u2013136","journal-title":"Stud Inf Univ"},{"key":"619_CR38","unstructured":"Hwang SM, Kao CY, Horng JT (1994) On solving rectangle bin packing problems using genetic algorithms. In: Proceedings of IEEE international conference on systems, man, and cybernetics, pp 1583\u20131590. San Antonio (TX)"},{"key":"619_CR39","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.cor.2009.05.008","volume":"37","author":"S Imahori","year":"2010","unstructured":"Imahori S, Yagiura M (2010a) The best-fit heuristic for the rectangular strip packing problem: an efficient implementation and the worst-case approximation ratio. Comput Oper Res 37:325\u2013333","journal-title":"Comput Oper Res"},{"key":"619_CR40","unstructured":"Imahori S, Yagiura M (2010b) Cutting and packing, test instances \u201cstrip packing problem\u201d. http:\/\/www-or.amp.i.kyoto-u.ac.jp\/~imahori\/packing\/instance.html"},{"key":"619_CR41","volume-title":"Algorithms for clustering data","author":"AK Jain","year":"1988","unstructured":"Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice-Hall, Upper Saddle River (NJ)"},{"key":"619_CR42","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv CSUR 31:264\u2013323","journal-title":"ACM Comput Surv CSUR"},{"key":"619_CR43","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S Jakobs","year":"1996","unstructured":"Jakobs S (1996) On genetic algorithms for the packing of polygons. Eur J Oper Res 88:165\u2013181","journal-title":"Eur J Oper Res"},{"key":"619_CR44","first-page":"1","volume":"91","author":"A Karami","year":"2014","unstructured":"Karami A, Johansson R (2014) Choosing dbscan parameters automatically using differential evolution. Int J Comput Appl 91:1\u201311","journal-title":"Int J Comput Appl"},{"key":"619_CR45","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"2009","unstructured":"Kaufman L, Rousseeuw PJ (2009) Finding groups in data: an introduction to cluster analysis, vol 344. Wiley, New York (NY)"},{"key":"619_CR46","first-page":"111","volume":"1","author":"S Kotsiantis","year":"2006","unstructured":"Kotsiantis S, Kanellopoulos D, Pintelas P (2006) Data preprocessing for supervised leaning. Int J Comput Sci 1:111\u2013117","journal-title":"Int J Comput Sci"},{"key":"619_CR47","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/0377-2217(95)00029-P","volume":"84","author":"B Kr\u00f6ger","year":"1995","unstructured":"Kr\u00f6ger B (1995) Guillotineable bin packing: a genetic approach. Eur J Oper Res 84:645\u2013661","journal-title":"Eur J Oper Res"},{"key":"619_CR48","doi-asserted-by":"crossref","first-page":"13032","DOI":"10.1016\/j.eswa.2011.04.105","volume":"38","author":"S Leung","year":"2011","unstructured":"Leung S, Zhang D (2011) A fast layer-based heuristic for non-guillotine strip packing. Expert Syst Appl 38:13032\u201313042","journal-title":"Expert Syst Appl"},{"key":"619_CR49","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ejor.2011.06.002","volume":"215","author":"SC Leung","year":"2011","unstructured":"Leung SC, Zhang D, Sim KM (2011) A two-stage intelligent search algorithm for the two-dimensional strip packing problem. Eur J Oper Res 215:57\u201369","journal-title":"Eur J Oper Res"},{"key":"619_CR50","unstructured":"Lijun W, Wenbin Z (2011) Skyline heuristic for the 2d rectangular packing and strip packing problems, under \u201cdata sets\u201d. https:\/\/www.computational-logistics.org\/orlib\/topic\/2D%20Strip%20Packing\/index.html"},{"key":"619_CR51","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/S0377-2217(97)00437-2","volume":"112","author":"D Liu","year":"1999","unstructured":"Liu D, Teng H (1999) An improved bl-algorithm for genetic algorithm of the orthogonal packing of rectangles. Eur J Oper Res 112:413\u2013420","journal-title":"Eur J Oper Res"},{"key":"619_CR52","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A Lodi","year":"1999","unstructured":"Lodi A, Martello S, Vigo D (1999) Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J Comput 11:345\u2013357","journal-title":"INFORMS J Comput"},{"key":"619_CR53","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","volume":"15","author":"S Martello","year":"2003","unstructured":"Martello S, Monaci M, Vigo D (2003) An exact approach to the strip-packing problem. INFORMS J Comput 15:310\u2013319","journal-title":"INFORMS J Comput"},{"key":"619_CR54","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manag Sci 44:388\u2013399","journal-title":"Manag Sci"},{"key":"619_CR55","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF02294245","volume":"50","author":"GW Milligan","year":"1985","unstructured":"Milligan GW, Cooper MC (1985) An examination of procedures for determining the number of clusters in a data set. Psychometrika 50:159\u2013179","journal-title":"Psychometrika"},{"key":"619_CR56","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1093\/comjnl\/26.4.354","volume":"26","author":"F Murtagh","year":"1983","unstructured":"Murtagh F (1983) A survey of recent advances in hierarchical clustering algorithms. Comput J 26:354\u2013359","journal-title":"Comput J"},{"key":"619_CR57","unstructured":"Ntene N (2007) An algorithmic approach to the 2D oriented strip packing problem. Phd dissertation Stellenbosch University, Stellenbosch"},{"key":"619_CR58","unstructured":"Ortmann FG (2010) Heuristics for offline rectangular packing problems. Phd dissertation Stellenbosch University, Stellenbosch"},{"key":"619_CR59","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106268","author":"RG Rakotonirainy","year":"2020","unstructured":"Rakotonirainy RG, Van Vuuren JH (2020) Improved metaheuristic for the two-dimensional strip packing problem. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2020.106268","journal-title":"Appl Soft Comput"},{"key":"619_CR60","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw PJ (1987) Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J Comput Appl Math 20:53\u201365","journal-title":"J Comput Appl Math"},{"key":"619_CR61","first-page":"329","volume":"1","author":"K Sawant","year":"2014","unstructured":"Sawant K (2014) Adaptive methods for determining dbscan parameters. Int J Innov Sci Eng Technol 1:329\u2013334","journal-title":"Int J Innov Sci Eng Technol"},{"key":"619_CR62","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1111\/1467-9868.00293","volume":"63","author":"R Tibshirani","year":"2001","unstructured":"Tibshirani R, Walther G, Hastie T (2001) Estimating the number of clusters in a data set via the gap statistic. J R Stat Soc Ser B Stat Methodol 63:411\u2013423","journal-title":"J R Stat Soc Ser B Stat Methodol"},{"key":"619_CR63","unstructured":"Valenzuela CL, Wang PY (2001) Heuristics for large strip packing problems with guillotine patterns: An empirical study. In: Metaheuristics International Conference 4, pp 417\u2013421. Porto"},{"key":"619_CR64","unstructured":"Van\u00a0Vuuren JH, Ortmann FG (2010) Benchmarks. http:\/\/www.vuuren.co.za\/main.php"},{"key":"619_CR65","unstructured":"Van\u00a0Vuuren JH, Rakotonirainy RG (2018) Benchmarks. http:\/\/www.vuuren.co.za\/main.php"},{"key":"619_CR66","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17:395\u2013416","journal-title":"Stat Comput"},{"key":"619_CR67","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/S0377-2217(00)00263-0","volume":"134","author":"PY Wang","year":"2001","unstructured":"Wang PY, Valenzuela CL (2001) Data set generation for rectangular placement problems. Eur J Oper Res 134:378\u2013391","journal-title":"Eur J Oper Res"},{"key":"619_CR68","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.cor.2016.11.024","volume":"80","author":"L Wei","year":"2017","unstructured":"Wei L, Hu Q, Leung SC, Zhang N (2017) An improved skyline based heuristic for the 2d strip packing problem and its efficient implementation. Comput Oper Res 80:113\u2013127","journal-title":"Comput Oper Res"},{"key":"619_CR69","first-page":"337","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:337\u2013346","journal-title":"Eur J Oper Res"},{"key":"619_CR70","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1111\/itor.12138","volume":"23","author":"L Wei","year":"2016","unstructured":"Wei L, Qin H, Cheang B, Xu X (2016) An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem. Int Trans Oper Res 23:65\u201392","journal-title":"Int Trans Oper Res"},{"key":"619_CR71","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu R, Wunsch D (2005) Survey of clustering algorithms. IEEE Trans Neural Netw 16:645\u2013678","journal-title":"IEEE Trans Neural Netw"},{"key":"619_CR72","unstructured":"Zelnik-Manor L, Perona P (2005) Self-tuning spectral clustering. In: Advances in Neural Information Processing Systems, pp 1601\u20131608. Vancouver"},{"key":"619_CR73","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1016\/j.cor.2005.01.009","volume":"33","author":"D Zhang","year":"2006","unstructured":"Zhang D, Kang Y, Deng A (2006) A new heuristic recursive algorithm for the strip rectangular packing problem. Comput Oper Res 33:2209\u20132217","journal-title":"Comput Oper Res"},{"key":"619_CR74","first-page":"911","volume":"33","author":"D-F Zhang","year":"2007","unstructured":"Zhang D-F, Sheng-Da C, Yan-Juan L (2007) An improved heuristic recursive strategy based on genetic algorithm for the strip rectangular packing problem. Acta Autom Sin 33:911\u2013916","journal-title":"Acta Autom Sin"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00619-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-021-00619-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00619-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T02:07:45Z","timestamp":1622686065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-021-00619-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,9]]},"references-count":74,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["619"],"URL":"https:\/\/doi.org\/10.1007\/s00291-021-00619-y","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"type":"print","value":"0171-6468"},{"type":"electronic","value":"1436-6304"}],"subject":[],"published":{"date-parts":[[2021,2,9]]},"assertion":[{"value":"27 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}