{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T07:57:17Z","timestamp":1773215837831,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,12,10]],"date-time":"2011-12-10T00:00:00Z","timestamp":1323475200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s00291-011-0277-9","type":"journal-article","created":{"date-parts":[[2011,12,9]],"date-time":"2011-12-09T09:21:29Z","timestamp":1323422489000},"page":"505-542","source":"Crossref","is-referenced-by-count":12,"title":["Conservative scales in packing problems"],"prefix":"10.1007","volume":"35","author":[{"given":"G.","family":"Belov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. M.","family":"Kartak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Rohling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Scheithauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,10]]},"reference":[{"issue":"2","key":"277_CR1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s00291-008-0128-5","volume":"31","author":"R Alvarez-Valdes","year":"2009","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit JM (2009) A branch and bound algorithm for the strip packing problem. OR Spectrum 31(2): 431\u2013459","journal-title":"OR Spectrum"},{"issue":"3","key":"277_CR2","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1016\/j.ejor.2005.11.060","volume":"183","author":"R Baldacci","year":"2007","unstructured":"Baldacci R, Boschetti MA (2007) A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem. Eur J Oper Res 183(3): 1136\u20131149","journal-title":"Eur J Oper Res"},{"key":"277_CR3","first-page":"21","volume-title":"CPAIOR. LNCS, vol 5015","author":"N Beldiceanu","year":"2008","unstructured":"Beldiceanu N, Carlsson M, Poder E (2008) New filtering for the cumulative constraint in the context of non-overlapping rectangles. In: Perron L, Trick MA (eds) CPAIOR. LNCS, vol 5015. Springer, Berlin, pp 21\u201335"},{"issue":"6","key":"277_CR4","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1111\/j.1475-3995.2009.00713.x","volume":"16","author":"G Belov","year":"2009","unstructured":"Belov G, Kartak V, Rohling H, Scheithauer G (2009) One-dimensional relaxations and LP bounds for orthogonal packing. Int Trans Oper Res 16(6): 745\u2013766","journal-title":"Int Trans Oper Res"},{"key":"277_CR5","first-page":"27","volume":"1","author":"MA Boschetti","year":"2003","unstructured":"Boschetti MA, Mingozzi A (2003) The two-dimensional finite bin packing problem. Part I: new lower bounds for the oriented case. 4OR: Q J Oper Res 1: 27\u201342","journal-title":"4OR: Q J Oper Res"},{"issue":"6","key":"277_CR6","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1287\/opre.1100.0833","volume":"58","author":"MA Boschetti","year":"2010","unstructured":"Boschetti MA, Montaletti L (2010) An exact algorithm for the two-dimensional strip-packing problem. Oper Res 58(6): 1774\u20131791","journal-title":"Oper Res"},{"key":"277_CR7","first-page":"27","volume":"100","author":"RH Byrd","year":"2004","unstructured":"Byrd RH, Gould NIM, Nocedal J, Waltz RA (2004) An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Math Program 100: 27\u201348","journal-title":"Math Program"},{"key":"277_CR8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0167-6377(03)00057-9","volume":"32","author":"A Caprara","year":"2004","unstructured":"Caprara A, Monaci M (2004) On the two-dimensional knapsack problem. Oper Res Lett 32: 5\u201314","journal-title":"Oper Res Lett"},{"issue":"1","key":"277_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10107-007-0184-7","volume":"118","author":"A Caprara","year":"2009","unstructured":"Caprara A, Monaci M (2009) Bidimensional packing by bilinear programming. Math Program 118(1): 75\u2013108","journal-title":"Math Program"},{"issue":"3","key":"277_CR10","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1016\/j.ejor.2005.09.034","volume":"176","author":"J Carlier","year":"2007","unstructured":"Carlier J, N\u00e9ron E (2007) Computing redundant resources for the resource constrained project scheduling problem. Eur J Oper Res 176(3): 1452\u20131463","journal-title":"Eur J Oper Res"},{"issue":"8","key":"277_CR11","doi-asserted-by":"crossref","first-page":"2223","DOI":"10.1016\/j.cor.2005.08.012","volume":"34","author":"J Carlier","year":"2007","unstructured":"Carlier J, Clautiaux F, Moukrim A (2007) New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Comput Oper Res 34(8): 2223\u20132250","journal-title":"Comput Oper Res"},{"issue":"3","key":"277_CR12","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.cor.2006.05.012","volume":"35","author":"F Clautiaux","year":"2008","unstructured":"Clautiaux F, Jouglet A, Carlier J, Moukrim A (2008) A new constraint programming approach for the orthogonal packing problem. Comput Oper Res 35(3): 944\u2013959","journal-title":"Comput Oper Res"},{"issue":"2","key":"277_CR13","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/00207540802426656","volume":"47","author":"F Clautiaux","year":"2009","unstructured":"Clautiaux F, Moukrim A, Carlier J (2009) New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem. Int J Prod Res 47(2): 537\u2013560","journal-title":"Int J Prod Res"},{"issue":"1","key":"277_CR14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10479-008-0453-8","volume":"179","author":"F Clautiaux","year":"2010","unstructured":"Clautiaux F, Alves C, Val\u00e9rio de Carvalho J (2010) A survey of dual-feasible functions for bin-packing problems. Ann Oper Res 179(1): 317\u2013342","journal-title":"Ann Oper Res"},{"issue":"4","key":"277_CR15","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1287\/ijoc.1100.0415","volume":"23","author":"F Clautiaux","year":"2011","unstructured":"Clautiaux F, Alves C, Val\u00e9rio de Carvalho J, Rietz J (2011) New stabilization procedures for the cutting stock problem. INFORMS JoC 23(4): 530\u2013545","journal-title":"INFORMS JoC"},{"issue":"10","key":"277_CR16","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1057\/jors.1984.180","volume":"35","author":"KA Dowsland","year":"1984","unstructured":"Dowsland KA (1984) The three-dimensional pallet chart: an analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problems. J Oper Res Soc 35(10): 895\u2013905","journal-title":"J Oper Res Soc"},{"key":"277_CR17","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF00939837","volume":"72","author":"RF Drenick","year":"1992","unstructured":"Drenick RF (1992) Multilinear programming: duality theories. J Optim Theory Appl 72: 459\u2013486","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"277_CR18","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"SP Fekete","year":"2001","unstructured":"Fekete SP, Schepers J (2001) New classes of lower bounds for the bin packing problem. Math Program 91(1): 11\u201331","journal-title":"Math Program"},{"issue":"2","key":"277_CR19","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/moor.1030.0079","volume":"29","author":"SP Fekete","year":"2004","unstructured":"Fekete SP, Schepers J (2004a) A combinatorial characterization of higher-dimensional orthogonal packing. Math Oper Res 29(2): 353\u2013368","journal-title":"Math Oper Res"},{"issue":"2","key":"277_CR20","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"SP Fekete","year":"2004","unstructured":"Fekete SP, Schepers J (2004b) A general framework for bounds for higher-dimensional orthogonal packing problems. Math Methods Oper Res 60(2): 311\u2013329","journal-title":"Math Methods Oper Res"},{"issue":"3","key":"277_CR21","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"SP Fekete","year":"2007","unstructured":"Fekete SP, Schepers J, van der Veen J (2007) An exact algorithm for higher-dimensional orthogonal packing. Oper Res 55(3): 569\u2013587","journal-title":"Oper Res"},{"key":"277_CR22","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. Freeman"},{"key":"277_CR23","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem (Part I). Oper Res 9: 849\u2013859","journal-title":"Oper Res"},{"key":"277_CR24","unstructured":"IBM Software (2010) IBM ILOG CPLEX optimizer. Data sheet. IBM Corporation. http:\/\/www.ibm.com"},{"key":"277_CR25","unstructured":"Johnson DS (1973) Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts"},{"key":"277_CR26","volume-title":"Calculation of rational cutting of stock","author":"LV Kantorovich","year":"1951","unstructured":"Kantorovich LV, Zalgaller VA (1951) Calculation of rational cutting of stock. Lenizdat, Leningrad"},{"key":"277_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"issue":"4","key":"277_CR28","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley","year":"1960","unstructured":"Kelley JE (1960) The cutting-plane method for solving convex programs. J Soc Ind Appl Math 8(4): 703\u2013712","journal-title":"J Soc Ind Appl Math"},{"issue":"2","key":"277_CR29","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.ejor.2010.01.037","volume":"206","author":"A Khanafer","year":"2010","unstructured":"Khanafer A, Clautiaux F, Talbi EG (2010) New lower bounds for bin packing problems with conflicts. Eur J Oper Res 206(2): 281\u2013288","journal-title":"Eur J Oper Res"},{"key":"277_CR30","doi-asserted-by":"crossref","unstructured":"Lueker GS (1983) Bin packing with items uniformly distributed over intervals [a,b]. In: Proc 24th Ann Symp of Comp Sci, Tucson, pp 289\u2013297","DOI":"10.1109\/SFCS.1983.9"},{"key":"277_CR31","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, Chichester. http:\/\/www.or.deis.unibo.it\/knapsack.html"},{"issue":"1","key":"277_CR32","first-page":"3","volume":"8","author":"R Misener","year":"2009","unstructured":"Misener R, Floudas CA (2009) Advances for the pooling problem: modeling, global optimization, and computational studies. Appl Comput Math 8(1): 3\u201322","journal-title":"Appl Comput Math"},{"key":"277_CR33","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York"},{"issue":"10","key":"277_CR34","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1287\/mnsc.28.10.1106","volume":"28","author":"F Palacios-Gomez","year":"1982","unstructured":"Palacios-Gomez F, Lasdon L, Engquist M (1982) Nonlinear optimization by successive linear programming. Manag Sci 28(10): 1106\u20131120","journal-title":"Manag Sci"},{"issue":"1","key":"277_CR35","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/ijoc.1060.0181","volume":"19","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Sigurd MM (2007) Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS J Comput 19(1): 36\u201351","journal-title":"INFORMS J Comput"},{"issue":"10","key":"277_CR36","doi-asserted-by":"crossref","first-page":"1929","DOI":"10.1016\/j.dam.2007.08.052","volume":"156","author":"J Rietz","year":"2008","unstructured":"Rietz J, Dempe S (2008) Large gaps in one-dimensional cutting stock problems. Discrete Appl Math 156(10): 1929\u20131935","journal-title":"Discrete Appl Math"},{"key":"277_CR37","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0166-218X(01)00361-4","volume":"121","author":"J Rietz","year":"2002","unstructured":"Rietz J, Scheithauer G, Terno J (2002) Families of non-IRUP instances of the one-dimensional cutting stock problem. Discrete Appl Math 121: 229\u2013245","journal-title":"Discrete Appl Math"},{"issue":"3","key":"277_CR38","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.orl.2010.01.002","volume":"38","author":"J Rietz","year":"2010","unstructured":"Rietz J, Alves C, Val\u00e9rio de Carvalho JM (2010) Theoretical investigations on maximal dual feasible functions. Oper Res Lett 38(3): 174\u2013178","journal-title":"Oper Res Lett"},{"key":"277_CR39","doi-asserted-by":"crossref","unstructured":"Rietz J, Alves C, Val\u00e9rio de Carvalho JM (2011) Worst-case analysis of maximal dual feasible functions. Optim Lett. doi: 10.1007\/s11590-011-0359-2","DOI":"10.1007\/s11590-011-0359-2"},{"issue":"3","key":"277_CR40","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.ejor.2009.01.033","volume":"200","author":"C Still","year":"2010","unstructured":"Still C, Westerlund T (2010) A linear programming-based optimization algorithm for solving nonlinear programming problems. Eur J Oper Res 200(3): 658\u2013670","journal-title":"Eur J Oper Res"},{"issue":"3","key":"277_CR41","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(3): 1109\u20131130","journal-title":"Eur J Oper Res"},{"issue":"10","key":"277_CR42","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1287\/mnsc.31.10.1312","volume":"31","author":"J Zhang","year":"1985","unstructured":"Zhang J, Kim N-H, Lasdon L (1985) An improved successive linear programming algorithm. Manag Sci 31(10): 1312\u20131331","journal-title":"Manag Sci"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-011-0277-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-011-0277-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-011-0277-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T17:23:22Z","timestamp":1561051402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-011-0277-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,10]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["277"],"URL":"https:\/\/doi.org\/10.1007\/s00291-011-0277-9","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,10]]}}}