{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:30:55Z","timestamp":1759667455893},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,10,10]],"date-time":"2008-10-10T00:00:00Z","timestamp":1223596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s10878-008-9191-8","type":"journal-article","created":{"date-parts":[[2008,10,9]],"date-time":"2008-10-09T14:07:21Z","timestamp":1223561241000},"page":"101-130","source":"Crossref","is-referenced-by-count":6,"title":["A hybrid beam search looking-ahead algorithm for\u00a0the\u00a0circular packing problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Hakim","family":"Akeb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mhand","family":"Hifi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,10]]},"reference":[{"key":"9191_CR1","doi-asserted-by":"crossref","unstructured":"Akeb H, Hifi M (2008) Adaptive algorithms for circular cutting\/packing problems. Int J Oper Res (to\u00a0appear)","DOI":"10.1504\/IJOR.2009.027152"},{"key":"9191_CR2","author":"H Akeb","year":"2008","unstructured":"Akeb H, Hifi M, M\u2019Hallah R (2008) A beam search algorithm for the circular packing problem. Comput Oper Res. doi: 10.1016\/j.cor.2008.02.003","journal-title":"Comput Oper Res"},{"key":"9191_CR3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1504\/IJOR.2006.009300","volume":"1","author":"E Baltacioglu","year":"2006","unstructured":"Baltacioglu E, Moore JT, Hill RR (2006) The distributor\u2019s three-dimensional pallet-packing problem: a human intelligence-based heuristic approach. Int J Oper Res 1:249\u2013266","journal-title":"Int J Oper Res"},{"key":"9191_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ejor.2003.06.018","volume":"160","author":"EG Birgin","year":"2005","unstructured":"Birgin EG, Martinez JM, Ronconi DP (2005) Optimizing the packing of cylinders into a rectangular container: A nonlinear approach. Eur J Oper Res 160:19\u201333","journal-title":"Eur J Oper Res"},{"key":"9191_CR5","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/opre.1060.0293","volume":"54","author":"E Burke","year":"2006","unstructured":"Burke E, Hellier R, Kendall G, Whitwell G (2006) A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Oper Res 54:587\u2013601","journal-title":"Oper Res"},{"key":"9191_CR6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1590\/S0101-74382000000200009","volume":"20","author":"MH Correia","year":"2000","unstructured":"Correia MH, Oliveira JF, Ferreira JS (2000) Cylinder packing by simulated annealing. Pesqui Oper 20:269\u2013286","journal-title":"Pesqui Oper"},{"key":"9191_CR7","first-page":"393","volume-title":"Annotated bibliography in combinatorial optimization","author":"H Dyckhoff","year":"1997","unstructured":"Dyckhoff H, Scheithauer G, Terno J (1997) Cutting and Packing (C&P). In: Dell\u2019Amico M, Maffioli F, Martello S (eds) Annotated bibliography in combinatorial optimization. Wiley, Chichester, pp 393\u2013413"},{"key":"9191_CR8","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/0377-2217(95)00032-L","volume":"84","author":"JA George","year":"1995","unstructured":"George JA, George JM, Lamar BW (1995) Packing different-sized circles into a rectangular container. Eur J Oper Res 84:693\u2013712","journal-title":"Eur J Oper Res"},{"key":"9191_CR9","doi-asserted-by":"crossref","first-page":"#R16","DOI":"10.37236\/1240","volume":"3","author":"RL Graham","year":"1996","unstructured":"Graham RL, Lubachevsky BD (1996) Repeated patterns of dense packings of equal disks in a square. Electron J Comb 3:#R16, 17\u00a0p","journal-title":"Electron J Comb"},{"key":"9191_CR10","first-page":"33","volume":"2","author":"M Hifi","year":"2002","unstructured":"Hifi M, M\u2019Hallah R (2002) A best-local position procedure-based heuristic for the two-dimensional layout problem. Stud Inf Univers Int J Inf 2:33\u201356","journal-title":"Stud Inf Univers Int J Inf"},{"key":"9191_CR11","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/S0305-0548(03)00020-0","volume":"31","author":"M Hifi","year":"2004","unstructured":"Hifi M, M\u2019Hallah R (2004) Approximate algorithms for the constrained circular cutting problem. Comput Oper Res 31:675\u2013694","journal-title":"Comput Oper Res"},{"key":"9191_CR12","unstructured":"Hifi M, Saadi T (2005) Using strip generation procedures for solving constrained two-staged cutting problems. In: ALIO\/EURO, the 5th conference on combinatorial optimization ENST, Paris, France, 26\u201328 October 2005"},{"key":"9191_CR13","doi-asserted-by":"crossref","unstructured":"Hifi M, Saadi T (2007) A cooperative algorithm for constrained two-staged two-dimensional cutting problems, Int J Oper Res (to appear)","DOI":"10.1109\/ICSSSM.2006.320756"},{"key":"9191_CR14","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/S0377-2217(03)00417-X","volume":"159","author":"M Hifi","year":"2004","unstructured":"Hifi M, Paschos VTh, Zissimopoulos V (2004) A simulated annealing approach for the circular cutting problem. Eur J Oper Res 159:430\u2013448","journal-title":"Eur J Oper Res"},{"key":"9191_CR15","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/ijoc.1070.0233","volume":"20","author":"M Hifi","year":"2008","unstructured":"Hifi M, M\u2019Hallah R, Saadi T (2008) Beam search algorithms for constrained two-staged two-dimensional cutting problems. INFORMS J Comput 20:212\u2013221","journal-title":"INFORMS J Comput"},{"key":"9191_CR16","doi-asserted-by":"crossref","first-page":"3270","DOI":"10.1016\/j.cor.2005.12.005","volume":"34","author":"WQ Huang","year":"2007","unstructured":"Huang WQ, Chen DB, Xu RC (2007) A new heuristic algorithm for rectangle packing. Comput Oper Res 34:3270\u20133280","journal-title":"Comput Oper Res"},{"key":"9191_CR17","doi-asserted-by":"crossref","first-page":"1742","DOI":"10.1016\/j.cor.2006.10.012","volume":"35","author":"ZP L\u00fc","year":"2008","unstructured":"L\u00fc ZP, Huang WQ (2008) PERM for solving circle packing problem. Comput Oper Res 35:1742\u20131755","journal-title":"Comput Oper Res"},{"key":"9191_CR18","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/0-306-48056-5_12","volume-title":"Handbook of metaheuristics, vol 57","author":"R Marti","year":"2003","unstructured":"Marti R (2003) Multi-start methods. In: Handbook of metaheuristics, vol 57. Springer, New York, pp\u00a0355\u2013368"},{"key":"9191_CR19","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1287\/opre.50.2.324.427","volume":"50","author":"S Menon","year":"2002","unstructured":"Menon S, Schrage L (2002) Order allocation for stock cutting in the paper industry. Oper Res 50:324\u2013332","journal-title":"Oper Res"},{"key":"9191_CR20","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/00207548808947840","volume":"26","author":"PS Ow","year":"1988","unstructured":"Ow PS, Morton TE (1988) Filtered beam search in scheduling. Int J Prod Res 26:35\u201362","journal-title":"Int J Prod Res"},{"key":"9191_CR21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/opre.1050.0228","volume":"54","author":"R Ravi","year":"2006","unstructured":"Ravi R, Sinha A (2006) Approximation algorithms for problems combining facility location and network design. Oper Res 54:73\u201381","journal-title":"Oper Res"},{"key":"9191_CR22","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0969-6016(98)00003-3","volume":"5","author":"YG Stoyan","year":"1998","unstructured":"Stoyan YG, Yaskov GN (1998) Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. Int Trans Oper Res 5: 45\u201357","journal-title":"Int Trans Oper Res"},{"key":"9191_CR23","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher G, Haussner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183:1109\u20131130","journal-title":"Eur J Oper Res"},{"key":"9191_CR24","doi-asserted-by":"crossref","first-page":"1941","DOI":"10.1016\/j.cor.2003.12.006","volume":"32","author":"DF Zhang","year":"2005","unstructured":"Zhang DF, Deng AS (2005) An effective hybrid algorithm for the problem of packing circles into a larger containing circle. Comput Oper Res 32:1941\u20131951","journal-title":"Comput Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9191-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9191-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9191-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T01:35:16Z","timestamp":1588988116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9191-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,10]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["9191"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9191-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,10]]}}}