{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T18:05:20Z","timestamp":1763057120935},"reference-count":21,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"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":[[1997,8]]},"DOI":"10.1016\/s0305-0548(96)00095-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"727-736","source":"Crossref","is-referenced-by-count":62,"title":["An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock"],"prefix":"10.1016","volume":"24","author":[{"given":"Mhand","family":"Hifi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0305-0548(96)00095-0_BIB1","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(96)00095-0_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(96)00095-0_BIB3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","article-title":"Packing problems","volume":"56","author":"Dowsland","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(96)00095-0_BIB4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","article-title":"Multistage cutting problems of two and more dimensions","volume":"13","author":"Gilmore","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00095-0_BIB5","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/mnsc.6.4.366","article-title":"Mathematical methods of organizing and planning production","volume":"6","author":"Kantorovich","year":"1960","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(96)00095-0_BIB6","series-title":"Discrete Optimization Algorithms","author":"Syslo","year":"1983"},{"issue":"7","key":"10.1016\/S0305-0548(96)00095-0_BIB7","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1057\/jors.1992.101","article-title":"Cutting and packing problems: a categorized application-oriented research bibliography","volume":"43","author":"Sweeney","year":"1992","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(96)00095-0_BIB8","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","article-title":"The theory and computation of knapsack functions","volume":"14","author":"Gilmore","year":"1966","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00095-0_BIB9","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 and Development"},{"key":"10.1016\/S0305-0548(96)00095-0_BIB10","doi-asserted-by":"crossref","first-page":"31","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"},{"issue":"3","key":"10.1016\/S0305-0548(96)00095-0_BIB11","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(96)00095-0_BIB12","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(96)00095-0_BIB13","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(96)00095-0_BIB14","series-title":"A general algorithm for two-dimensional cutting","author":"Fayard","year":"1995"},{"key":"10.1016\/S0305-0548(96)00095-0_BIB15","first-page":"345","article-title":"Heuristic methods for solving (un)constrained two-dimensional cutting stock problems","volume":"49","author":"Zissimopoulos","year":"1984","journal-title":"Methods of Operations Research"},{"issue":"2","key":"10.1016\/S0305-0548(96)00095-0_BIB16","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(96)00095-0_BIB17","article-title":"Study of some combinatorial optimization problems: cutting stock, rectangular packing and set covering problems","author":"Hifi","year":"1994"},{"key":"10.1016\/S0305-0548(96)00095-0_BIB18","first-page":"0","article-title":"The DH\/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems","volume":"0","author":"Hifi","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(96)00095-0_BIB19","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1287\/opre.17.6.1017","article-title":"A graph theoretic approach to a class of integer programming problems","volume":"17","author":"Desler","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00095-0_BIB20","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02243880","article-title":"Dynamic programming algorithms for zero-one knapsack problem","volume":"25","author":"Toth","year":"1980","journal-title":"Computing"},{"key":"10.1016\/S0305-0548(96)00095-0_BIB21","series-title":"Optimisation Combinatoire, Programmation Discr\u00e8te","author":"Sakarovich","year":"1984"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000950?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000950?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T01:21:16Z","timestamp":1555204876000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000950"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0305054896000950"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00095-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}