{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T04:25:49Z","timestamp":1784262349393,"version":"3.55.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0305-0548(00)00095-2","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"925-947","source":"Crossref","is-referenced-by-count":90,"title":["A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems"],"prefix":"10.1016","volume":"29","author":[{"given":"Ram\u00f3n","family":"Alvarez-Vald\u00e9s","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio","family":"Paraj\u00f3n","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jose\u2019e Manuel","family":"Tamarit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00095-2_BIB1","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1057\/palgrave.jors.2600638","article-title":"An efficient approach for large-scale two-dimensional guillotine cutting stock problems","volume":"49","author":"Fayard","year":"1998","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1057\/jors.1985.51","article-title":"Algorithms for unconstrained two-dimensional guillotine cutting","volume":"36","author":"Beasley","year":"1985","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB3","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/0377-2217(95)00343-6","article-title":"A recursive exact algorithm for weighted two-dimensional cutting","volume":"91","author":"Hifi","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.25.1.30","article-title":"An algorithm for two-dimensional cutting problems","volume":"25","author":"Christofides","year":"1977","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB5","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/opre.41.4.768","article-title":"Best-first search methods for constrained two-dimensional cutting stock problems","volume":"41","author":"Viswanathan","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0377-2217(93)E0277-5","article-title":"An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts","volume":"83","author":"Christofides","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB7","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/S0305-0548(96)00095-0","article-title":"An improvement of Viswanathan and Bagchi's exact algorithm for cutting stock problems","volume":"24","author":"Hifi","year":"1997","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB8","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1057\/palgrave.jors.2600364","article-title":"Constrained two-dimensional cutting: an improvement of Chrisfofides and Whitlock's exact algorithm","volume":"48","author":"Hifi","year":"1997","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0377-2217(92)90212-R","article-title":"An and-or-graph approach for two-dimensional cutting problems","volume":"58","author":"Morabito","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB10","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/0377-2217(93)E0221-I","article-title":"An approximation algorithm for solving unconstrained two-dimensional knapsack problems","volume":"84","author":"Fayard","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0377-2217(96)00060-4","article-title":"The DH\/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems","volume":"97","author":"Hifi","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB12","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/0377-2217(95)00128-X","article-title":"Staged and constrained two-dimensional guillotine cutting problems: an AND\/OR-graph approach","volume":"94","author":"Morabito","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB13","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.31.3.573","article-title":"Two algorithms for constrained two-dimensional cutting stock problems","volume":"31","author":"Wang","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0360-8352(96)00215-X","article-title":"Best-first search and dynamic programming methods for cutting problems: the cases of one or more stock plates","volume":"32","author":"Hifi","year":"1997","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB15","series-title":"Knapsack problems. Algorithms and computer implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A probabilistic heuristic for a computationally difficult set covering problem","volume":"8","author":"Feo","year":"1989","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB17","first-page":"1","article-title":"Greedy randomized adaptive search procedures","volume":"2","author":"Feo","year":"1995","journal-title":"Journal of Global Oprimization"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB18","series-title":"Tabu search","author":"Glover","year":"1997"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB19","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1147\/rd.165.0462","article-title":"A recursive computing procedure for two-dimensional stock cutting","volume":"16","author":"Herz","year":"1972","journal-title":"IBM Journal of Research Development"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB20","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1051\/ro\/1996300201111","article-title":"Une amelioration de l'algorithme recursif de Herz por le probleme de decoupe a deux dimensions","volume":"30","author":"Hifi","year":"1996","journal-title":"RAIRO"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB21","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/0377-2217(90)90361-E","article-title":"An improved version of Wang's algorithm for two-dimensional cutting problems","volume":"44","author":"Oliveira","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00095-2_BIB22","unstructured":"Tsch\u00f6ke S, Holth\u00f6fer N. A new parallel approach to the constrained two-dimensional cutting stock problem. Technical Report, University of Padeborn, D.C.S. 33095 Padeborn. Germany, 1996."},{"key":"10.1016\/S0305-0548(00)00095-2_BIB23","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1111\/j.1475-3995.2000.tb00194.x","article-title":"Constrained two-dimensional cutting stock problems. A best-first branch-and-bound algorithm","volume":"7","author":"Cung","year":"2000","journal-title":"International Transactions in Operational Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000952?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000952?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T14:56:23Z","timestamp":1556463383000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000952"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0305054800000952"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00095-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}