{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T09:54:46Z","timestamp":1679392486916},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T00:00:00Z","timestamp":1315440000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s10100-011-0228-1","type":"journal-article","created":{"date-parts":[[2011,9,7]],"date-time":"2011-09-07T17:52:16Z","timestamp":1315417936000},"page":"237-264","source":"Crossref","is-referenced-by-count":3,"title":["Constrained order packing: comparison of heuristic approaches for a new bin packing problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Nikolaus","family":"Furian","sequence":"first","affiliation":[]},{"given":"Siegfried","family":"V\u00f6ssner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,8]]},"reference":[{"key":"228_CR1","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"JO Berkey","year":"1987","unstructured":"Berkey JO, Wang PY (1987) Two dimensional finite bin packing algorithms. J Operat Res Soc 38: 423\u2013429","journal-title":"J Operat Res Soc"},{"key":"228_CR2","first-page":"135","volume":"1","author":"A Boschetti","year":"2003","unstructured":"Boschetti A, Mingozzi A (2003) The two-dimensional finite bin packing problem. Part ii: New lower and upper bounds. 4OR 1: 135\u2013147","journal-title":"4OR"},{"key":"228_CR3","unstructured":"Caprara A, Lodi A, Monaci M (1999) An approximation scheme for the two-stage, two-dimensional bin packing problem. In: Proceedings of the 9th conference integer programming and combinatorial optinmization (IPCO 2002), Springer Lecture notes in computer science vol. 2337. Springer, Berlin, pp 320\u2013334"},{"key":"228_CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0167-6377(03)00092-0","volume":"32","author":"A Caprara","year":"2004","unstructured":"Caprara A, Pferschy U (2004) Worst-case analysis of the subset sum algorithm for bin packing. Operat Res Lett 32: 159\u2013166","journal-title":"Operat Res Lett"},{"key":"228_CR5","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.ipl.2005.04.005","volume":"96","author":"A Caprara","year":"2005","unstructured":"Caprara A, Pferschy U (2005) Modified subset sum heuristics for bin packing. Inf Process Lett 96: 18\u201323","journal-title":"Inf Process Lett"},{"key":"228_CR6","doi-asserted-by":"crossref","first-page":"2223","DOI":"10.1016\/j.cor.2005.08.012","volume":"33","author":"J Carlier","year":"2007","unstructured":"Carlier J, Clautiaux F, Moukrin A (2007) New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Comput Operat Res 33: 2223\u20132250","journal-title":"Comput Operat Res"},{"key":"228_CR7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.orl.2006.07.001","volume":"35","author":"F Clautiaux","year":"2007","unstructured":"Clautiaux F, Jouglet A, El Hayek J (2007) A new lower bound for the non-oriented two-dimensional bin packing problem. Operat Res Lett 35: 365\u2013373","journal-title":"Operat Res Lett"},{"key":"228_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0166-218X(01)00253-0","volume":"118","author":"M Dell\u2019Amico","year":"2002","unstructured":"Dell\u2019Amico M, Martello S, Vigo D (2002) A lower bound for the non-oriented two dimensional bin packing problem. Discret Appl Math 118: 13\u201324","journal-title":"Discret Appl Math"},{"issue":"1","key":"228_CR9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","volume":"56","author":"KA Downsland","year":"1992","unstructured":"Downsland KA, Downsland WB (1992) Packing problems. Eur J Operat Res 56(1): 2\u201314","journal-title":"Eur J Operat Res"},{"key":"228_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H Dyckhoff","year":"1990","unstructured":"Dyckhoff H (1990) A typology of cutting and packing problems. Eur J Operat Res 44: 145\u2013159","journal-title":"Eur J Operat Res"},{"key":"228_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58165-6","volume-title":"Cutting and packing in production and distribution: a typology and bibliography","author":"H Dyckhoff","year":"1992","unstructured":"Dyckhoff H, Finke U (1992) Cutting and packing in production and distribution: a typology and bibliography. Physica Verlag, Heidelberg"},{"key":"228_CR12","volume-title":"Annoted bibliographies in combinatorial optimization","author":"H Dyckhoff","year":"1997","unstructured":"Dyckhoff H, Scheithauer G, Terno J (1997) Cutting and packing. In: Maffioli F, Dell\u2019Amico M, Martello S (eds) Annoted bibliographies in combinatorial optimization. Wiley, Chichester"},{"key":"228_CR13","doi-asserted-by":"crossref","first-page":"3184","DOI":"10.1016\/j.cor.2007.02.013","volume":"35","author":"J El Hayek","year":"2008","unstructured":"El Hayek J, Moukrim A, Negre S (2008) New resolution algorithm and pretreatments for the two-dimensional bin-packing problem. Comput Operat Res 35: 3184\u20133201","journal-title":"Comput Operat Res"},{"key":"228_CR14","unstructured":"Fekete SP, Schepers J (1997) On more-dimensional packing iii: exact algorithms. Technical paper ZPR97-290, Mathematisches Institut, Universitt zu Kln"},{"key":"228_CR15","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, USA"},{"key":"228_CR16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10100-008-0057-z","volume":"16","author":"W Gutjahr","year":"2008","unstructured":"Gutjahr W, Katzensteiner S, Reiter P, Stummer C, Denk M (2008) Competence-driven project portfolio selection, scheduling and staff assignment. Cent Eur J Operat Res 16: 281\u2013306","journal-title":"Cent Eur J Operat Res"},{"key":"228_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10100-010-0162-7","volume":"19","author":"K Hentsch","year":"2010","unstructured":"Hentsch K, K\u00f6chel P (2010) Job scheduling with forbidden setups and two objectives using genetic algorithms and penalties. Cent Eur J Operat Res 19: 285\u2013298","journal-title":"Cent Eur J Operat Res"},{"key":"228_CR18","first-page":"1044","volume":"2","author":"H Iima","year":"2003","unstructured":"Iima H, Yakawa T (2003) A new design of genetic algorithm for bin packing. Congr Evolut Comput 2: 1044\u20131049","journal-title":"Congr Evolut Comput"},{"key":"228_CR19","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.ejor.2007.06.032","volume":"190","author":"DS Liu","year":"2008","unstructured":"Liu DS, Tan KC, Huang SY, Goh CK, Ho WK (2008) On solving multiobjective bin packing problems using evolutionary particle swarm optimization. Eur J Operat Res 190: 357\u2013382","journal-title":"Eur J Operat Res"},{"key":"228_CR20","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/S0377-2217(97)00388-3","volume":"112","author":"A Lodi","year":"1999","unstructured":"Lodi A, Martello S, Vigo D (1999a) Approximation algorithms for the oriented two-dimenional bin packing problem. Eur J Operat Res 112: 158\u2013166","journal-title":"Eur J Operat Res"},{"key":"228_CR21","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A Lodi","year":"1999","unstructured":"Lodi A, Martello S, Vigo D (1999b) Heuristic and metaheuristic approaches for a class of two-dinemsional bin packing problems. INFORMS J Comput 11: 345\u2013357","journal-title":"INFORMS J Comput"},{"key":"228_CR22","first-page":"379","volume":"123","author":"A Lodi","year":"2002","unstructured":"Lodi A, Martello S, Vigo D (2002a) Recent advances on two-dimensional bin packing problems. Eur J Operat Res 123: 379\u2013396","journal-title":"Eur J Operat Res"},{"key":"228_CR23","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi A, Martello S, Vigo D (2002b) Two dimensional bin packing problems: a survey. Eur J Operat Res 141: 241\u2013252","journal-title":"Eur J Operat Res"},{"key":"228_CR24","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/B:ANOR.0000039519.03572.08","volume":"131","author":"A Lodi","year":"2004","unstructured":"Lodi A, Martello S, Vigo D (2004) Tspack: a unified Tabu search code for multi-dimensional bin packing problems. Ann Operat Res 131: 203\u2013213","journal-title":"Ann Operat Res"},{"key":"228_CR25","doi-asserted-by":"crossref","unstructured":"Mack D, Bortfeldt A (2010) A heuristic for solving large bin packing problems in two and three dimensions. Cent Eur J Operat Res. doi: 10.1007\/s10100-010-0184-1","DOI":"10.1007\/s10100-010-0184-1"},{"issue":"3","key":"228_CR26","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manag Sci 44(3): 388\u2013399","journal-title":"Manag Sci"},{"key":"228_CR27","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Teller A, Teller EJ (1953) Simulated annealing. J Chem Phys 21: 1087\u20131092","journal-title":"J Chem Phys"},{"key":"228_CR28","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.ejor.2007.10.020","volume":"192","author":"S Polyakovsky","year":"2009","unstructured":"Polyakovsky S, M\u2019Hallah R (2009) An agent-based approach to the two-dimensional guillotine bin packing problem. Eur J Operat Res 192: 767\u2013781","journal-title":"Eur J Operat Res"},{"issue":"7","key":"228_CR29","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1080\/002075499191166","volume":"37","author":"A Ramesh Babu","year":"1999","unstructured":"Ramesh Babu A, Ramesh Babu N (1999) Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. Int J Prod Res 37(7): 1625\u20131643","journal-title":"Int J Prod Res"},{"key":"228_CR30","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/S0010-4485(00)00112-3","volume":"33","author":"A Ramesh Babu","year":"2001","unstructured":"Ramesh Babu A, Ramesh Babu N (2001) A generic approach for nesting of 2-d parts in 2-d sheets using genetic and heuristic algorithms. Comput Aided Des 33: 879\u2013891","journal-title":"Comput Aided Des"},{"key":"228_CR31","doi-asserted-by":"crossref","unstructured":"Reiter P, Gutjahr WJ (2010) Exact hybrid algorithms for solving a bi-objective vehicle routing problem. Cent Eur J Operat Res. doi: 10.1007\/s10100-010-0158-3","DOI":"10.1007\/s10100-010-0158-3"},{"key":"228_CR32","doi-asserted-by":"crossref","unstructured":"Rohlfshagen P, Bullinaria JA (2007) A genetic algorithm with exon shuffling crossover for hard bin packing problems. In: Proceedings of the 9th annual conference on genetic and evolutionary computation. pp 1365\u20131371","DOI":"10.1145\/1276958.1277213"},{"key":"228_CR33","doi-asserted-by":"crossref","unstructured":"Terashima-Mar\u00edn H, Far\u00edas Z\u00e1rate CJ, Ross P, Valenzuela-Rend\u00f3n M (2006) A ga-based method to produce generalized hyper-heuristics for the 2d-regular cutting stock problem. In: Proceedings of the 8th annual conference on genetic and evolutionary computation. pp 591\u2013598","DOI":"10.1145\/1143997.1144102"},{"key":"228_CR34","doi-asserted-by":"crossref","unstructured":"Terashima-Mar\u00edn H, Flores-\u00e1lvarez EJ, Ross P (2005) Hyper-heuristics and classifier systems for solving 2d-regular cutting stock problems. In: Proceedings of the 2005 conference on genetic and evolutionary computation. pp 637\u2013643","DOI":"10.1145\/1068009.1068115"},{"key":"228_CR35","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, Hau\u00df ner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Operat Res 183: 1109\u20131130","journal-title":"Eur J Operat Res"},{"issue":"16","key":"228_CR36","doi-asserted-by":"crossref","first-page":"3883","DOI":"10.1080\/0020754031000149239","volume":"41","author":"TH Wu","year":"2003","unstructured":"Wu TH, Chen JF, Low C, Tang PT (2003) Nesting of two-dimensional parts in multiple plates using hybrid algorithm. Int J Prod Res 41(16): 3883\u20133900","journal-title":"Int J Prod Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-011-0228-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-011-0228-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-011-0228-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:29Z","timestamp":1559123369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-011-0228-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,8]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["228"],"URL":"https:\/\/doi.org\/10.1007\/s10100-011-0228-1","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,8]]}}}