{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:13:04Z","timestamp":1762297984662},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,3,16]],"date-time":"2013-03-16T00:00:00Z","timestamp":1363392000000},"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":[[2014,3]]},"DOI":"10.1007\/s10100-012-0282-3","type":"journal-article","created":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T19:22:17Z","timestamp":1363375337000},"page":"157-186","source":"Crossref","is-referenced-by-count":2,"title":["A hybrid algorithm for constrained order packing"],"prefix":"10.1007","volume":"22","author":[{"given":"Nikolaus","family":"Furian","sequence":"first","affiliation":[]},{"given":"Siegfried","family":"V\u00f6ssner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,16]]},"reference":[{"issue":"5","key":"282_CR1","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/TSMC.1980.4308483","volume":"10","author":"A Albano","year":"1980","unstructured":"Albano A, Sapuppo G (1980) Optimal allocation of two-dimensional irregualr shapes using heuristic search methods. IEEE Trans Syst Man Cybern 10(5):242\u2013248","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"282_CR2","doi-asserted-by":"crossref","unstructured":"Augustine J, Banerjee S, Irani S (2006) Strip packing with precedence constraints and strip packing with release times. In: Proceedings of the eighteenth annual ACM symposium on parallelism in algorithms and architectures, SPAA \u201906, ACM, New York, pp 180\u2013189","DOI":"10.1145\/1148109.1148139"},{"issue":"7","key":"282_CR3","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1080\/002075499191166","volume":"37","author":"AR Babu","year":"1999","unstructured":"Babu AR, Babu NR (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":"282_CR4","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/S0010-4485(00)00112-3","volume":"33","author":"AR Babu","year":"2001","unstructured":"Babu AR, Babu NR (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":"282_CR5","doi-asserted-by":"crossref","unstructured":"Boschetti A, Mingozzi A (2003a) The two-dimensional finite bin packing problem. Part i: new lower bounds for the oriented case. 4OR 1:27\u201342","DOI":"10.1007\/s10288-002-0005-z"},{"key":"282_CR6","doi-asserted-by":"crossref","unstructured":"Boschetti A, Mingozzi A (2003b) The two-dimensional finite bin packing problem. Part ii: new lower and upper bounds. 4OR 1:135\u2013147","DOI":"10.1007\/s10288-002-0006-y"},{"key":"282_CR7","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. Oper Res Lett 32:159\u2013166","journal-title":"Oper Res Lett"},{"key":"282_CR8","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":"282_CR9","doi-asserted-by":"crossref","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 Oper Res 33:2223\u20132250","DOI":"10.1016\/j.cor.2005.08.012"},{"key":"282_CR10","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 (2007) A new lower bound for the non-oriented two-dimensional bin packing problem. Oper Res Lett 35:365\u2013373","journal-title":"Oper Res Lett"},{"key":"282_CR11","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"},{"key":"282_CR12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"key":"282_CR13","volume-title":"Approximation and online algorithms, vol 4368, chapter on bin packing with conflicts","author":"L Epstein","year":"2007","unstructured":"Epstein L, Levin A (2007) Approximation and online algorithms, vol 4368, chapter on bin packing with conflicts. Springer, Heidelberg"},{"issue":"3","key":"282_CR14","first-page":"155","volume":"45","author":"L Epstein","year":"2008","unstructured":"Epstein L, Levin A, van Stee R (2008) Two-dimensional packing with conflicts. Acta Inf 45(3):155\u2013175","journal-title":"Two-dimensional packing with conflicts. Acta Inf"},{"key":"282_CR15","unstructured":"Fekete SP, Schepers J (2000) On more-dimensional packing ii: bounds. Technical report ZPR97-289, Mathematisches Institut, Universitt zu Kln"},{"key":"282_CR16","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"SP Fekete","year":"2004","unstructured":"Fekete SP, Schepers J (2004) A general framework for bounds for higher-dimensional orthogonal packing problems. Math Methods Oper Res 60:311\u2013329","journal-title":"Math Methods Oper Res"},{"key":"282_CR17","doi-asserted-by":"crossref","first-page":"3324","DOI":"10.1016\/j.cor.2005.03.027","volume":"33","author":"L Fu","year":"2006","unstructured":"Fu L, Sun D, Rilett LR (2006) Heuristic stortest path algorithms for transportation applications: state of the art. Comput Oper Res 33:3324\u20133343","journal-title":"Comput Oper Res"},{"key":"282_CR18","doi-asserted-by":"crossref","unstructured":"Furian N, V\u00f6ssner S (2013) Constrained order packing\u2013comparison of heuristic approaches for a new bin packing problem. Cent Eur J Oper Res 21:237\u2013265","DOI":"10.1007\/s10100-011-0228-1"},{"key":"282_CR19","doi-asserted-by":"crossref","unstructured":"Gomes AM, Oliveira JF (2002) A 2-exchange heuristic for nesting problems. Eur J Oper Res 141(2): 359\u2013370","DOI":"10.1016\/S0377-2217(02)00130-3"},{"issue":"2","key":"282_CR20","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heurisitic determination of minimum cost paths. IEEE Trans Sys Sci Cybern 4(2):100\u2013107","journal-title":"IEEE Trans Sys Sci Cybern"},{"key":"282_CR21","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":"282_CR22","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M Iori","year":"2010","unstructured":"Iori M, Martello S (2010) Routing problems with loading constraints. TOP 18:4\u201327","journal-title":"TOP"},{"key":"282_CR23","unstructured":"Johnson DS (1973) Near optimal bin packing algorithms. Dissertation, Massachussetts Institute of Technology, Cambridge"},{"key":"282_CR24","doi-asserted-by":"crossref","unstructured":"Johnston RE, Sadinlija E (2004) A new model for complete solutions to one-dimensional cutting stock problems. Eur J Oper Res 153(1):176\u2013183","DOI":"10.1016\/S0377-2217(02)00704-X"},{"key":"282_CR25","doi-asserted-by":"crossref","unstructured":"Khanafer A, Clautiaux F, Talbi E-G (2012) Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts. Comput, Oper Res 39(1):54\u201363","DOI":"10.1016\/j.cor.2010.07.009"},{"key":"282_CR26","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-dimensional bin packing problem. Eur J Oper Res 112:158\u2013166","journal-title":"Eur J Oper Res"},{"key":"282_CR27","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":"282_CR28","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 Oper Res 131:203\u2013213","journal-title":"Ann Oper Res"},{"key":"282_CR29","doi-asserted-by":"crossref","unstructured":"Mack D, Bortfeldt A (2012) A heuristic for solving large bin packing problems in two and three dimensions. Cent Eur J Oper Res 20(2):337\u2013354","DOI":"10.1007\/s10100-010-0184-1"},{"key":"282_CR30","doi-asserted-by":"crossref","unstructured":"Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manag Sci 44(3)","DOI":"10.1287\/mnsc.44.3.388"},{"key":"282_CR31","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/j.ejor.2009.03.042","volume":"201","author":"H Reinertsen","year":"2010","unstructured":"Reinertsen H, Vossen TWM (2010) The one-dimensional cutting stock problem with due dates. Eur J Oper Res 201:701\u2013711","journal-title":"Eur J Oper Res"},{"key":"282_CR32","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1016\/j.ejor.2005.12.050","volume":"183","author":"F Rinaldi","year":"2007","unstructured":"Rinaldi F, Franz A (2007) A two-dimensional strip cutting problem with sequencing constraint. Eur J Oper Res 183:1371\u20131384","journal-title":"Eur J Oper Res"},{"key":"282_CR33","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\u00dfner 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"},{"issue":"16","key":"282_CR34","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-012-0282-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-012-0282-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-012-0282-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T01:10:08Z","timestamp":1562807408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-012-0282-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,16]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["282"],"URL":"https:\/\/doi.org\/10.1007\/s10100-012-0282-3","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,16]]}}}