{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T06:41:03Z","timestamp":1775112063920,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"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":[[2004,4]]},"DOI":"10.1016\/s0305-0548(03)00019-4","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T14:55:35Z","timestamp":1048604135000},"page":"657-674","source":"Crossref","is-referenced-by-count":28,"title":["Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study"],"prefix":"10.1016","volume":"31","author":[{"given":"Mhand","family":"Hifi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00019-4_BIB1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0377-2217(90)90362-F","article-title":"A comparative evaluation of heuristic for container loading","volume":"44","author":"Bischoff","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB2","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(03)00019-4_BIB3","first-page":"503","article-title":"Algorithms for unconstrained two-dimensional guillotine cutting","volume":"84","author":"Beasley","year":"1985","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB4","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(03)00019-4_BIB5","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(03)00019-4_BIB6","unstructured":"Hifi M. Dynamic programming and hill-climbing techniques for the constrained cutting stock problem. Journal of Combinatorial Optimization 2002; in press."},{"key":"10.1016\/S0305-0548(03)00019-4_BIB7","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(03)00019-4_BIB8","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1016\/S0305-0548(00)00095-2","article-title":"A Tabu search for large-scale (un)constrained two-dimensional cutting problems","volume":"29\/7","author":"Alvares-Vald\u00e9s","year":"2002","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0377-2217(96)00060-4","article-title":"The DH\/KD algorithm","volume":"97","author":"Hifi","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB10","first-page":"59","article-title":"An and\/or graph approach for two-dimensional cutting problems","volume":"1","author":"Morabito","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(84)80059-5","article-title":"Dynamic, first-fit packings in two or more dimensions","volume":"61","author":"Coffman","year":"1984","journal-title":"Information and Control"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0305-0548(80)90001-5","article-title":"A heuristic for packing boxes into a container","volume":"7","author":"George","year":"1980","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0377-2217(90)90364-H","article-title":"Load planning for shipments of low density products","volume":"44","author":"Haessler","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB14","doi-asserted-by":"crossref","unstructured":"Hifi M. Approximate algorithms for the container loading problem. International Transactions in Operational Research 2002; in press.","DOI":"10.1111\/1475-3995.00386"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0377-2217(92)90212-R","article-title":"An and\/or graph approach to the container loading problem","volume":"58","author":"Morabito","year":"1994","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB16","first-page":"107","article-title":"Computer aided selection of rational container sizes in automated transport and storage systems","volume":"59","author":"Movshovich","year":"1988","journal-title":"Soviet Electrical Engineering, USA"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB17","first-page":"563","article-title":"An efficient algorithm for container loading","volume":"64","author":"Portmann","year":"1990","journal-title":"Methods of Operations Research"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB18","unstructured":"Prosser P. A hybrid genetic algorithm for pallet loading. In: Proceeding of the Eighth European Conference on Artificial Intelligence. Pitman, London, 1988. p. 159\u201364."},{"key":"10.1016\/S0305-0548(03)00019-4_BIB19","first-page":"31","article-title":"An algorithm for two-dimensional cutting problems","volume":"2","author":"Christofides","year":"1977","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB20","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1111\/j.1475-3995.2000.tb00194.x","article-title":"Constrained two-dimensional cutting problem","volume":"7","author":"Cung","year":"2000","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/S0305-0548(03)00019-4_BIB21","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","article-title":"A minimal algorithm for the 0-1 knapsack problem","volume":"45","author":"Pisinger","year":"1997","journal-title":"Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000194?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000194?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T17:57:26Z","timestamp":1553450246000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803000194"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0305054803000194"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00019-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}