{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:08:10Z","timestamp":1764936490505},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10479-008-0453-8","type":"journal-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T16:17:21Z","timestamp":1225988241000},"page":"317-342","source":"Crossref","is-referenced-by-count":52,"title":["A survey of dual-feasible and superadditive functions"],"prefix":"10.1007","volume":"179","author":[{"given":"Fran\u00e7ois","family":"Clautiaux","sequence":"first","affiliation":[]},{"given":"Cl\u00e1udio","family":"Alves","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Val\u00e9rio\u00a0de\u00a0Carvalho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"453_CR1","volume-title":"Polyhedral combinatorics","author":"K. Aardal","year":"1997","unstructured":"Aardal, K., & Weismantel, R. (1997). Polyhedral combinatorics. New York: Wiley."},{"key":"453_CR2","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1051\/ro:2008027","volume":"42","author":"C. Alves","year":"2008","unstructured":"Alves, C., & Val\u00e9rio de Carvalho, J. M. (2008). A branch-and-price-and-cut algorithm for the pattern minimization problem. RAIRO Operations Research, 42, 435\u2013453.","journal-title":"RAIRO Operations Research"},{"key":"453_CR3","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, M. (2007). A cutting plane approach for the two-dimensional orthogonal non guillotine cutting stock problem. European Journal of Operational Research, 183, 1136\u20131149.","journal-title":"European Journal of Operational Research"},{"key":"453_CR4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.dam.2003.08.004","volume":"140","author":"M. Boschetti","year":"2004","unstructured":"Boschetti, M. (2004). New lower bounds for the three-dimensional finite bin packing problem. Discrete Applied Mathematics, 140, 241\u2013258.","journal-title":"Discrete Applied Mathematics"},{"key":"453_CR5","first-page":"27","volume":"1","author":"M. Boschetti","year":"2003","unstructured":"Boschetti, M., & Mingozzi, A. (2003a). The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 4OR, 1, 27\u201342.","journal-title":"4OR"},{"key":"453_CR6","first-page":"135","volume":"1","author":"M. Boschetti","year":"2003","unstructured":"Boschetti, M., & Mingozzi, A. (2003b). The two-dimensional finite bin packing problem. Part II: New lower and upper bounds. 4OR, 1, 135\u2013147.","journal-title":"4OR"},{"key":"453_CR7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0167-5060(08)70730-1","volume":"1","author":"C. A. Burdett","year":"1977","unstructured":"Burdett, C. A., & Johnson, E. L. (1977). A subadditive approach to solve linear integer programs. Annals of Discrete Mathematics, 1, 117\u2013144.","journal-title":"Annals of Discrete Mathematics"},{"key":"453_CR8","doi-asserted-by":"crossref","unstructured":"Caprara, A., & Monaci, M. (2007) Bidimensional packing by bilinear programming. Mathematical Programming. doi: 10.1007\/s10107-007-0184-7 .","DOI":"10.1007\/s10107-007-0184-7"},{"key":"453_CR9","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0377-2217(99)00494-4","volume":"127","author":"J. Carlier","year":"2000","unstructured":"Carlier, J., & N\u00e9ron, E. (2000). A new LP-based lower bound for the cumulative scheduling problem. European Journal of Operational Research, 127, 363\u2013382.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"453_CR10","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/S0377-2217(02)00763-4","volume":"149","author":"J. Carlier","year":"2003","unstructured":"Carlier, J., & N\u00e9ron, E. (2003). On linear lower bounds for the resource constraint project scheduling problem. European Journal of Operational Research, 149(2), 314\u2013324.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"453_CR11","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. European Journal of Operational Research, 176(3), 1452\u20131463.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"453_CR12","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. Computers and Operations Research, 34(8), 2223\u20132250.","journal-title":"Computers and Operations Research"},{"key":"453_CR13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V. (1973). Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics, 4, 305\u2013337.","journal-title":"Discrete Mathematics"},{"key":"453_CR14","unstructured":"Clautiaux, F. (2005) Bornes inf\u00e9rieures et m\u00e9thodes exactes pour le probl\u00e8me de bin-packing en deux dimensions avec orientation fixe. PhD thesis, Universit\u00e9 de Technologie de Compi\u00e8gne, France."},{"key":"453_CR15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10107-005-0599-y","volume":"105","author":"S. Dash","year":"2006","unstructured":"Dash, S., & G\u00fcnl\u00fck, O. (2006). Valid inequalities based on simple mixed-integer sets. Mathematical Programming, 105, 29\u201353.","journal-title":"Mathematical Programming"},{"key":"453_CR16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"S. Fekete","year":"2001","unstructured":"Fekete, S., & Schepers, J. (2001). New classes of fast lower bounds for bin packing problems. Mathematical Programming, 91, 11\u201331.","journal-title":"Mathematical Programming"},{"key":"453_CR17","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"S. Fekete","year":"2004","unstructured":"Fekete, S., & Schepers, J. (2004). A general framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research, 60, 311\u2013329.","journal-title":"Mathematical Methods of Operations Research"},{"key":"453_CR18","volume-title":"Computers and intractability, a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability, a guide to the theory of NP-completeness. New York: Freeman."},{"key":"453_CR19","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/0377-2217(95)00023-J","volume":"84","author":"T. Gau","year":"1995","unstructured":"Gau, T., & Waescher, G. (1995). CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem. European Journal of Operational Research, 84, 572\u2013579.","journal-title":"European Journal of Operational Research"},{"key":"453_CR20","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P. Gilmore","year":"1961","unstructured":"Gilmore, P., & Gomory, R. (1961). A linear programming approach to the cutting stock problem. Operations Research, 9, 849\u2013859.","journal-title":"Operations Research"},{"key":"453_CR21","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P. Gilmore","year":"1963","unstructured":"Gilmore, P., & Gomory, R. (1963). A linear programming approach to the cutting stock problem\u2014part II. Operations Research, 11, 863\u2013888.","journal-title":"Operations Research"},{"key":"453_CR22","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R. Gomory","year":"1958","unstructured":"Gomory, R. (1958). Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society, 64, 275\u2013278.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"453_CR23","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/conm\/374\/06903","volume":"374","author":"J. B. Lasserre","year":"2005","unstructured":"Lasserre, J. B. (2005). Integer programming, duality and superadditive functions. Contemporary Mathematics, 374, 139\u2013150.","journal-title":"Contemporary Mathematics"},{"key":"453_CR24","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/S0167-6377(02)00112-8","volume":"30","author":"A. N. Letchford","year":"2002","unstructured":"Letchford, A. N., & Lodi, A. (2002). Strengthening Chv\u00e1tal-Gomory cuts and Gomory fractional cuts. Operations Research Letters, 30, 74\u201382.","journal-title":"Operations Research Letters"},{"key":"453_CR25","first-page":"289","volume-title":"Proc. of the 24th annual symposium on foundations of computer science (FOCS 83)","author":"G. S. Lueker","year":"1983","unstructured":"Lueker, G. S. (1983). Bin packing with items uniformly distributed over intervals [a, b]. In Proc. of the 24th annual symposium on foundations of computer science (FOCS 83) (pp. 289\u2013297). Silver Spring: IEEE Computer Society."},{"key":"453_CR26","volume-title":"Knapsack problems\u2014algorithms and computer implementation","author":"S. Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems\u2014algorithms and computer implementation. Chichester: Wiley."},{"key":"453_CR27","volume-title":"Integer and combinatorial optimization","author":"G. L. Nemhauser","year":"1999","unstructured":"Nemhauser, G. L., & Wolsey, L. A. (1999). Integer and combinatorial optimization. New York: Wiley-Interscience."},{"issue":"6","key":"453_CR28","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1287\/opre.48.6.915.12391","volume":"46","author":"F. Vanderbeck","year":"2000","unstructured":"Vanderbeck, F. (2000). Exact algorithm for minimizing the number of setups in the one-dimensional cutting stock problem. Operations Research, 46(6), 915\u2013926.","journal-title":"Operations Research"},{"key":"453_CR29","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. European Journal of Operational Research, 183, 1109\u20131130.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0453-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0453-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0453-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:51Z","timestamp":1559153271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0453-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,7]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["453"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0453-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,7]]}}}