{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T23:21:12Z","timestamp":1769556072908,"version":"3.49.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T00:00:00Z","timestamp":1583539200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T00:00:00Z","timestamp":1583539200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11047-020-09786-3","type":"journal-article","created":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T15:02:31Z","timestamp":1583593351000},"page":"145-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Solving two-dimensional cutting stock problem via a DNA computing algorithm"],"prefix":"10.1007","volume":"20","author":[{"given":"M.","family":"Dodge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. A.","family":"MirHassani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Hooshmand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,7]]},"reference":[{"issue":"266","key":"9786_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"11","author":"L Adleman","year":"1994","unstructured":"Adleman L (1994) Molecular computation of solutions to combinatorial problems. Science 11(266):1021\u20131023","journal-title":"Science"},{"issue":"2","key":"9786_CR2","first-page":"12","volume":"5","author":"H Ahrabian","year":"2008","unstructured":"Ahrabian H, Mirzaei A, Nowzari-dalini A (2008) A DNA sticker algorithm for solving N-queen problem. Int J Comput Sci Appl 5(2):12\u201322","journal-title":"Int J Comput Sci Appl"},{"issue":"7","key":"9786_CR3","doi-asserted-by":"publisher","first-page":"1487","DOI":"10.1016\/j.cor.2011.08.021","volume":"39","author":"C Alves","year":"2012","unstructured":"Alves C, Br\u00e1s P, de Carvalho JV, Pinto T (2012) New constructive algorithms for leather nesting in the automotive industry. Comput Oper Res 39(7):1487\u20131505","journal-title":"Comput Oper Res"},{"key":"9786_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-23638-9_6","volume-title":"DNA computing and molecular programming","author":"MG Arnold","year":"2011","unstructured":"Arnold MG (2011) An improved DNA-sticker addition algorithm and its application to logarithmic arithmetic. In: Cardelli L, Shih W (eds) DNA computing and molecular programming. Springer, Berlin, pp 34\u201348"},{"issue":"1","key":"9786_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s11047-012-9334-9","volume":"12","author":"M Babaei","year":"2013","unstructured":"Babaei M (2013) A novel text and image encryption method based on chaos theory and DNA computing. Nat Comput 12(1):101\u2013107","journal-title":"Nat Comput"},{"issue":"1","key":"9786_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.dam.2012.03.026","volume":"163","author":"R Baldacci","year":"2014","unstructured":"Baldacci R, Boschetti MA, Ganovelli M, Maniezzo V (2014) Algorithm for nesting with defects. Discrete Appl Math 163(1):17\u201333","journal-title":"Discrete Appl Math"},{"issue":"1","key":"9786_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ejor.2018.03.029","volume":"270","author":"JA Bennell","year":"2018","unstructured":"Bennell JA, Cabo M, Mart\u00ednez-Sykoraa A (2018) A beam search approach to solve the convex irregular bin packing problem with guillotine cuts. Eur J Oper Res 270(1):89\u2013102","journal-title":"Eur J Oper Res"},{"key":"9786_CR8","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-37619-4_20","volume-title":"Parallel and distributed processing and applications","author":"WL Chang","year":"2003","unstructured":"Chang WL, Guo M, Ho M (2003) Solving the set-splitting problem in sticker-based model. In: Guo M, Yang LT (eds) Parallel and distributed processing and applications. Springer, Berlin, pp 185\u2013196"},{"issue":"3","key":"9786_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0925-5273(94)00045-X","volume":"36","author":"CH Cheng","year":"1994","unstructured":"Cheng CH, Feiring BR, Cheng TCE (1994) The cutting stock problem\u2014a survey. Int J Prod Econ 36(3):291\u2013305","journal-title":"Int J Prod Econ"},{"issue":"4","key":"9786_CR10","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/opre.47.4.495","volume":"47","author":"C Chu","year":"1999","unstructured":"Chu C, Antonio J (1999) Approximate algorithms to solve real-life multicriteria cutting stock problems. Oper Res 47(4):495\u2013508","journal-title":"Oper Res"},{"issue":"2","key":"9786_CR11","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.cor.2007.10.019","volume":"36","author":"Y Cui","year":"2009","unstructured":"Cui Y, Lu Y (2009) Heuristic algorithm for a cutting stock problem in the steel bridge construction. Comput Oper Res 36(2):612\u2013622","journal-title":"Comput Oper Res"},{"issue":"2","key":"9786_CR12","first-page":"1033","volume":"187","author":"M Darehmiraki","year":"2007","unstructured":"Darehmiraki M, Mishmast Nehi H (2007) Molecular solution to the 0\u20131 knapsack problem based on DNA computing. Appl Math Comput 187(2):1033\u20131037","journal-title":"Appl Math Comput"},{"issue":"2","key":"9786_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0377-2217(90)90360-N","volume":"44","author":"AA Farley","year":"1990","unstructured":"Farley AA (1990) The cutting stock problem in the canvas industry. Eur J Oper Res 44(2):247\u2013255","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9786_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10479-008-0458-3","volume":"179","author":"CA Glass","year":"2008","unstructured":"Glass CA, van Oostrum JM (2008) Bun splitting: a practical cutting stock problem. Ann Oper Res 179(1):15\u201333","journal-title":"Ann Oper Res"},{"issue":"1","key":"9786_CR15","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.ejor.2014.03.027","volume":"238","author":"J Kallrath","year":"2014","unstructured":"Kallrath J, Rebennack S, Kallrath J, Kusche R (2014) Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges. Eur J Oper Res 238(1):374\u2013389","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9786_CR16","first-page":"636","volume":"20","author":"Z Kang","year":"2009","unstructured":"Kang Z, Xiaojun T, Jin X (2009) Closed circle DNA algorithm of change positive-weighted Hamilton circuit problem. Syst Eng Electron 20(3):636\u2013642","journal-title":"Syst Eng Electron"},{"issue":"5","key":"9786_CR17","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s002360050125","volume":"35","author":"L Kari","year":"1998","unstructured":"Kari L et al (1998) DNA computing, sticker systems, and universality. Acta Inform 35(5):401\u2013420","journal-title":"Acta Inform"},{"key":"9786_CR18","unstructured":"Khullar S, Chopra V, Kahlon MS (2007) DNA computing: migrating from silicon chips to test tubes. In: National conference on challenges and opportunities in information technology"},{"issue":"1\u20133","key":"9786_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.biosystems.2004.06.005","volume":"78","author":"JY Lee","year":"2004","unstructured":"Lee JY, Shin SY, Park TH, Zhang BT (2004) Solving traveling salesman problems with DNA molecules encoding numerical values. BioSystems 78(1\u20133):39\u201347","journal-title":"BioSystems"},{"issue":"6","key":"9786_CR20","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1016\/j.tcs.2009.07.031","volume":"411","author":"X Liu","year":"2010","unstructured":"Liu X, Yang X, Li S, Ding Y (2010) Solving the minimum bisection problem using a biologically inspired computational model. Theoret Comput Sci 411(6):888\u2013896","journal-title":"Theoret Comput Sci"},{"issue":"4","key":"9786_CR21","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1016\/j.cie.2013.02.009","volume":"64","author":"HC Lu","year":"2013","unstructured":"Lu HC, Huang YH, Tseng KA (2013) An integrated algorithm for cutting stock problems in the thin-film transistor liquid crystal display industry. Comput Ind Eng 64(4):1084\u20131092","journal-title":"Comput Ind Eng"},{"issue":"1","key":"9786_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF01588227","volume":"17","author":"OBG Madsen","year":"1979","unstructured":"Madsen OBG (1979) Glass cutting in a small firm. Math Program 17(1):85\u201390","journal-title":"Math Program"},{"issue":"1\u20134","key":"9786_CR23","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s00170-015-7107-1","volume":"81","author":"SA MirHassani","year":"2015","unstructured":"MirHassani SA, Jalaeian Bashirzadeh A (2015) A GRASP meta-heuristic for two-dimensional irregular cutting stock problem. Int J Adv Manuf Technol 81(1\u20134):455\u2013464","journal-title":"Int J Adv Manuf Technol"},{"issue":"6432","key":"9786_CR24","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1126\/science.278.5337.446","volume":"363","author":"Q Ouyang","year":"1997","unstructured":"Ouyang Q, Kaplan PD, Liu S, Libchaber A (1997) DNA solution of the maximal clique problem. Science 363(6432):446\u2013449","journal-title":"Science"},{"issue":"50","key":"9786_CR25","first-page":"2921","volume":"2","author":"S Paul","year":"2008","unstructured":"Paul S, Sahoo G (2008) A DNA computing model to solve 0-1 integer programming problem. Appl Math Sci 2(50):2921\u20132929","journal-title":"Appl Math Sci"},{"key":"9786_CR26","unstructured":"P\u00e9rez-Jim\u00e9nez J, Sancho-Caparrini F (2001) Solving knapsack problems in a sticker based model. In: DNA computing. s.l.: international workshop on DNA-based computers. pp 161\u2013171"},{"key":"9786_CR27","first-page":"231","volume-title":"Recent results in natural computing","author":"MJ P\u00e9rez-Jim\u00e9nez","year":"2005","unstructured":"P\u00e9rez-Jim\u00e9nez MJ, Sancho-Caparrini F (2005) Generating pairwise disjoint families through DNA computations. In: P\u00e9rez-Jim\u00e9nez MJ, Romero-Jim\u00e9nez A, Sancho-Caparrini F (eds) Recent results in natural computing. F\u00e9nix Editora, Sevilla, pp 231\u2013246"},{"issue":"17","key":"9786_CR28","doi-asserted-by":"publisher","first-page":"3581","DOI":"10.1016\/j.ins.2011.04.026","volume":"181","author":"M Razzazi","year":"2011","unstructured":"Razzazi M, Roayaei M (2011) Using sticker model of DNA computing to solve domatic partition, kernel and induced path problems. Inf Sci 181(17):3581\u20133600","journal-title":"Inf Sci"},{"key":"9786_CR29","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.cor.2016.11.006","volume":"87","author":"MO Rodrigues","year":"2017","unstructured":"Rodrigues MO, Toledo FMB (2017) A clique covering MIP model for the irregular strip packing problem. Comput Oper Res 87:221\u2013234","journal-title":"Comput Oper Res"},{"issue":"4","key":"9786_CR30","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1089\/cmb.1998.5.615","volume":"5","author":"S Roweis","year":"1998","unstructured":"Roweis S et al (1998) A sticker-based model for DNA computation. J Comput Biol 5(4):615\u2013629","journal-title":"J Comput Biol"},{"issue":"6","key":"9786_CR31","first-page":"2055","volume":"215","author":"CAA Sanches","year":"2009","unstructured":"Sanches CAA, Soma NY (2009) A polynomial-time DNA computing solution for the bin-packing problem. Appl Math Comput 215(6):2055\u20132062","journal-title":"Appl Math Comput"},{"key":"9786_CR32","first-page":"436","volume":"238","author":"CAA Sanches","year":"2014","unstructured":"Sanches CAA, Soma NY (2014) A computational DNA solution approach for the quadratic Diophantine equation. Appl Math Comput 238:436\u2013443","journal-title":"Appl Math Comput"},{"key":"9786_CR33","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/341419","author":"H Taghipour","year":"2013","unstructured":"Taghipour H, Rezaei M, Esmaili HA (2013) Solving the 0\/1 knapsack problem by a biomolecular DNA computer. Adv Bioinform. https:\/\/doi.org\/10.1155\/2013\/341419","journal-title":"Adv Bioinform"},{"issue":"2","key":"9786_CR34","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ijpe.2013.04.009","volume":"145","author":"FMB Toledo","year":"2013","unstructured":"Toledo FMB et al (2013) The dotted-board model: a new MIP model for nesting irregular shapes. Int J Prod Econ 145(2):478\u2013487","journal-title":"Int J Prod Econ"},{"issue":"1","key":"9786_CR35","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/17452750701330968","volume":"2","author":"SK Tyagi","year":"2007","unstructured":"Tyagi SK, Ghorpade A, Karunakaran KP, Tiwari MK (2007) Optimal part orientation in layered manufacturing using evolutionary stickers-based DNA algorithm. Virtual Phys Prototyp 2(1):3\u201319","journal-title":"Virtual Phys Prototyp"},{"issue":"10","key":"9786_CR36","doi-asserted-by":"publisher","first-page":"25338","DOI":"10.3390\/ijms161025338","volume":"16","author":"Z Wang","year":"2015","unstructured":"Wang Z, Pu J, Cao L, Tan J (2015) A parallel biological optimization algorithm to solve the unbalanced assignment problem based on DNA molecular computing. Int J Mol Sci 16(10):25338\u201325352","journal-title":"Int J Mol Sci"},{"key":"9786_CR37","first-page":"31","volume":"33","author":"E Winfree","year":"2003","unstructured":"Winfree E (2003) DNA computing by self-Assembly. The Bridge 33:31\u201338","journal-title":"The Bridge"},{"issue":"1","key":"9786_CR38","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1023\/A:1023332711880","volume":"2","author":"DH Wood","year":"2003","unstructured":"Wood DH (2003) DNA computing capabilities for game theory. Nat Comput 2(1):85\u2013108","journal-title":"Nat Comput"},{"issue":"6","key":"9786_CR39","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1080\/10002007088537467","volume":"17","author":"J Xingpeng","year":"2007","unstructured":"Xingpeng J, Yin L, Ya M, Dazhi M (2007) A new DNA alogorithm to solve graph coloring problem. Prog Nat Sci 17(6):733\u2013738","journal-title":"Prog Nat Sci"},{"issue":"8","key":"9786_CR40","first-page":"772","volume":"49","author":"J Xu","year":"2004","unstructured":"Xu J, Dong Y, Wei X (2004) Sticker DNA computer model-part 1: theory. Chin Sci Bull 49(8):772\u2013780","journal-title":"Chin Sci Bull"},{"key":"9786_CR41","doi-asserted-by":"publisher","first-page":"2541","DOI":"10.1007\/s11434-006-2145-6","volume":"51","author":"J Xu","year":"2006","unstructured":"Xu J, Qiang X, Gang F, Zhou K (2006) A DNA computer model for solving vertex coloring problem. Chin Sci Bull 51:2541\u20132549","journal-title":"Chin Sci Bull"},{"key":"9786_CR42","doi-asserted-by":"crossref","unstructured":"Zhang H, Liu X (2016) A DNA sticker model for the hierarchical clustering problems. In: China, IEEE advanced information management, communicates, electronic and automation control conference (IMCEC)","DOI":"10.1109\/IMCEC.2016.7867267"},{"issue":"3","key":"9786_CR43","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0010-4655(02)00270-9","volume":"144","author":"KH Zimmermann","year":"2002","unstructured":"Zimmermann KH (2002) Efficient DNA sticker algorithms for NP-complete graph problems. Comput Phys Commun 144(3):297\u2013309","journal-title":"Comput Phys Commun"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-020-09786-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-020-09786-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-020-09786-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,7]],"date-time":"2021-03-07T00:18:42Z","timestamp":1615076322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-020-09786-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,7]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["9786"],"URL":"https:\/\/doi.org\/10.1007\/s11047-020-09786-3","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,7]]},"assertion":[{"value":"7 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}