{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:18:06Z","timestamp":1761488286524},"reference-count":24,"publisher":"Hindawi Limited","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"name":"Regional Council of Champagne-Ardenne"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Advances in Operations Research"],"published-print":{"date-parts":[[2009]]},"abstract":"<jats:p>We consider the two-dimensional strip packing problem with guillotine cuts. The problem consists in packing a set of rectangular items on one strip of width<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>W<\/mml:mi><\/mml:math>and infinite height. The items packed without overlapping must be extracted by a series of cuts that go from one edge to the opposite edge (guillotine constraint). To solve this problem, we use a dichotomic algorithm that uses a lower bound, an upper bound, and a feasibility test algorithm. The lower bound is based on solving a linear program by introducing new valid inequalities. A new heuristic is used to compute the upper bound. Computational results show that the dichotomic algorithm, using the new bounds, gives good results compared to existing methods.<\/jats:p>","DOI":"10.1155\/2009\/732010","type":"journal-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T14:59:56Z","timestamp":1248188396000},"page":"1-20","source":"Crossref","is-referenced-by-count":11,"title":["An Exact Method for the 2D Guillotine Strip Packing Problem"],"prefix":"10.1155","volume":"2009","author":[{"given":"Abdelghani","family":"Bekrar","sequence":"first","affiliation":[{"name":"Research and Development Department in Algorithmic, DynaSys S.A., Allee de Stockholm, 67300 Schiltigheim, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Imed","family":"Kacem","sequence":"additional","affiliation":[{"name":"LITA Laboratory, University of Paul Verlaine Metz, Ile du Saulcy, 57000 Metz, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"98","reference":[{"issue":"1","key":"8","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1137\/0603007","volume":"3","year":"1982","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1987.70"},{"key":"12","first-page":"x+338","year":"1979"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.3.310.16082"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00130-3"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.01.006"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.01.009"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.11.016"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012590107280"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00008-2"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.08.011"},{"issue":"2","key":"2","first-page":"151","volume":"1","year":"2007","journal-title":"Journal of Industrial and Systems Engineering"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.08.007"},{"key":"1"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90094-S"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2005.01.002"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00002-T"},{"issue":"1","key":"27","first-page":"18","volume":"4","year":"2007","journal-title":"International Journal of Operations Research"},{"issue":"2","key":"11","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/mnsc.11.2.268","volume":"11","year":"1964","journal-title":"Management Science"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038915.62826.79"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0369"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.048"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.05.012"},{"issue":"2","key":"14","first-page":"169","volume":"19","year":"1999","journal-title":"Pesquisa Operacional"}],"container-title":["Advances in Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/aor\/2009\/732010.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/aor\/2009\/732010.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/aor\/2009\/732010.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T22:08:28Z","timestamp":1497823708000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/aor\/2009\/732010\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"references-count":24,"alternative-id":["732010","732010"],"URL":"https:\/\/doi.org\/10.1155\/2009\/732010","relation":{},"ISSN":["1687-9147","1687-9155"],"issn-type":[{"value":"1687-9147","type":"print"},{"value":"1687-9155","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}