{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:48:26Z","timestamp":1767340106328,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":47,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387254852"},{"type":"electronic","value":"9780387254869"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/0-387-25486-2_5","type":"book-chapter","created":{"date-parts":[[2006,3,10]],"date-time":"2006-03-10T22:51:10Z","timestamp":1142031070000},"page":"131-161","source":"Crossref","is-referenced-by-count":25,"title":["Cutting Stock Problems"],"prefix":"10.1007","author":[{"given":"Hatem","family":"Ben Amor","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Val\u00e9rio de Carvalho","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., and Orlin, J. (1993). Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, New Jersey."},{"key":"5_CR2","series-title":"Technical Report","volume-title":"A stabilized branch-and-price algorithm for integer variable sized bin-packing problems","author":"C. Alves","year":"2003","unstructured":"Alves, C. and Val\u00e9rio de Carvalho, J.M. (2003). A stabilized branch-and-price algorithm for integer variable sized bin-packing problems. Technical Report, Universidade do Minho, Portugal; http:\/\/www.dps.uminho.pt\/cad-dps."},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C, Johnson, E.L., Nemhauser, G., Savelsbergh, M., and Vance, P. (1998). Branch-and-Price: Column generation for solving huge integer programs. Operations Research, 46:316\u2013329.","journal-title":"Operations Research"},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E. (1990). Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41:1060\u20131072.","journal-title":"Journal of the Operational Research Society"},{"key":"5_CR5","unstructured":"Belov, G. (2003). Problems, models and algorithms in one-and two-eimensional cutting. Ph.D Thesis, Fakult\u00e4t Mathematik und Naturwissenschaften der Technischen, Universit\u00e4t Dresden, Dresden, Germany."},{"key":"5_CR6","unstructured":"Ben Amor, H. (1997). R\u00e9solution du probl\u00e8me de d\u00e9coupe par g\u00e9n\u00e9ration de colonnes. Master\u2019s Thesis, \u00c9cole Polytechnique de Montr\u00e9al, Canada."},{"key":"5_CR7","unstructured":"Ben Amor, H. (2002). Stabilisation de l\u2019algorithme de g\u00e9n\u00e9ration de colonnes. Ph.D Thesis, \u00c9cole Polytechnique de Montr\u00e9al, Canada."},{"key":"5_CR8","volume-title":"Les Cahiers du GERAD G-2003-20","author":"H. Ben Amor","year":"2003","unstructured":"Ben Amor, H., Desrosiers. J., and Val\u00e9rio de Carvalho, J.M. (2003). Dual-optimal inequalities for stabilized column generation. Les Cahiers du GERAD G-2003-20, HEC, Montr\u00e9al, Canada."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/ijoc.15.1.58.15156","volume":"15","author":"Z. Degraeve","year":"2003","unstructured":"Degraeve, Z. and Peeters, M. (2003). Optimal integer solutions to industrial cutting-stock problems: Part 2, benchmark results. INFORMS Journal on Computing, 15:58\u201381.","journal-title":"INFORMS Journal on Computing"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1287\/ijoc.11.4.406","volume":"11","author":"Z. Degraeve","year":"1999","unstructured":"Degraeve, Z. and Schrage, L. (1999). Optimal integer solutions to industrial cutting stock problems. INFORMS Journal on Computing, 11:406\u2013419.","journal-title":"INFORMS Journal on Computing"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-1-4615-5755-5_3","volume-title":"Fleet Management and Logistics","author":"G. Desaulniers","year":"1998","unstructured":"Desaulniers, G., Desrosiers, J., Ioachim, I, Solomon, M.M., Soumis, F., and Villeneuve, D. (1998). A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In: Fleet Management and Logistics (Crainic, T.G. and Laporte, G., eds.), pp. 57\u201393. Kluwer, Norwell, MA."},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., and Solomon, M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40:342\u2013354.","journal-title":"Operations Research"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M., and Soumis, F. (1995). Time constrained routing and scheduling. In: Handbooks in Operations Research & Management Science 8, Network Routing, pp. 35\u2013139. Elsevier Science B. V.","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","volume":"56","author":"K.A. Dowsland","year":"1992","unstructured":"Dowsland, K.A. and Dowsland, W.B. (1992). Packing problems. European Journal of Operational Research, 56:2\u201314.","journal-title":"European Journal of Operational Research"},{"key":"5_CR15","doi-asserted-by":"publisher","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. European Journal of Operational Research, 44:145\u2013159.","journal-title":"European Journal of Operational Research"},{"key":"5_CR16","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. and Finke, U. (1992). Cutting and Packing in Production and Distribution: a typology and bibliography. Physica-Verlag, Heidelberg."},{"key":"5_CR17","first-page":"393","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"H. Dyckhoff","year":"1997","unstructured":"Dyckhoff, H., Scheithauer, G., and Terno, J. (1997). Cutting and packing. In: Annotated Bibliographies in Combinatorial Optimization, pp. 393\u2013413. John Wiley and Sons, Chichester."},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.38.5.922","volume":"38","author":"A. Farley","year":"1990","unstructured":"Farley, A. (1990). A note on bounding a class of linear programming problems, including cutting stock problems. Operations Research, 38:992\u2013993.","journal-title":"Operations Research"},{"key":"5_CR19","first-page":"217","volume-title":"Annals of Discrete Mathematics","author":"P. Gilmore","year":"1979","unstructured":"Gilmore, P. (1979). Cutting stock, linear programming, knapsacking, dynamic programming and integer programming, some interconnections. In: Annals of Discrete Mathematics 4, pp. 217\u2013236. North Holland, Amsterdam."},{"key":"5_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. and Gomory, R. (1961). A linear programming approach to the cutting stock problem. Operations Research, 9:849\u2013859.","journal-title":"Operations Research"},{"key":"5_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. and Gomory, R. (1963). A linear programming approach to the cutting stock problem-Part 2. Operations Research, 11:863\u2013888.","journal-title":"Operations Research"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0377-2217(90)90355-F","volume":"44","author":"C. Goulimis","year":"1990","unstructured":"Goulimis, C. (1990). Optimal solutions to the cutting stock problem. European Journal of Operational Research, 44:197\u2013208.","journal-title":"European Journal of Operational Research"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02099696","volume":"57","author":"C. Helmberg","year":"1995","unstructured":"Helmberg, C. (1995). Cutting aluminum coils with high lengths variabilities. Annals of Operations Research, 57:175\u2013189.","journal-title":"Annals of Operations Research"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/mnsc.6.4.366","volume":"6","author":"L. Kantorovich","year":"1960","unstructured":"Kantorovich, L. (1960). Mathematical methods of organising and planning production (translated from a report in Russian, dated 1939). Management Science, 6:366\u2013422.","journal-title":"Management Science"},{"issue":"4","key":"5_CR25","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"J.E. Kelley Jr.","year":"1961","unstructured":"Kelley Jr., J.E. (1961). The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math., 8(4):703\u2013712.","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF01582013","volume":"33","author":"O. Marcotte","year":"1985","unstructured":"Marcotte, O. (1985). The cutting stock problem and integer rounding. Mathematical Programming, 33:82\u201392.","journal-title":"Mathematical Programming"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0167-6377(86)90009-X","volume":"4","author":"O. Marcotte","year":"1986","unstructured":"Marcotte, O. (1986). An instance of the cutting stock problem for which the rounding property does not hold. Operations Research Letters, 4:239\u2013243.","journal-title":"Operations Research Letters"},{"key":"5_CR28","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S. and Toth, P. (1990). Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York."},{"key":"5_CR29","unstructured":"Monaci, M. (2002). Algorithms for packing and scheduling problems. Ph.D Thesis, Universit\u00e0 Degli Studi di Bologna, Bologna, Italy."},{"issue":"6","key":"5_CR30","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1080\/0233193021000066545","volume":"51","author":"J. Rietz","year":"2002","unstructured":"Rietz, J. and Scheithauer, G. (2002). Tighter bounds for the gap and non-IRUP constructions in the one-dimensional cutting stock problem. Optimization, 51(6):927\u2013963.","journal-title":"Optimization"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/0377-2217(95)00022-I","volume":"84","author":"G. Scheithauer","year":"1995","unstructured":"Scheithauer, G. and Terno, J. (1995). The modified integer round-up property of the one-dimensional cutting stock problem. European Journal of Operational Research, 84:562\u2013571.","journal-title":"European Journal of Operational Research"},{"key":"5_CR32","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"P. Scholl","year":"1997","unstructured":"Scholl, P., Klein, R., and Juergens, C. (1997). Bison: a fast hybrid procedure for exactly solving the one-dimensional bin-packing problem. Computers and Operations Research, 24:627\u2013645.","journal-title":"Computers and Operations Research"},{"key":"5_CR33","first-page":"5","volume":"6","author":"J. Sessions","year":"1988","unstructured":"Sessions, J., Layton, R., and Guanda, L. (1988). Improving tree bucking decisions: A network approach. The Compiler, 6:5\u20139.","journal-title":"The Compiler"},{"key":"5_CR34","first-page":"271","volume":"35","author":"J. Sessions","year":"1989","unstructured":"Sessions, J., Olsen, E., and Garland, J. (1989). Tree bucking for optimal stand value with log allocation constraints. Forest World, 35:271\u2013276.","journal-title":"Forest World"},{"key":"5_CR35","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/opre.16.1.103","volume":"16","author":"J. Shapiro","year":"1968","unstructured":"Shapiro, J. (1968). Dynamic programming algorithms for the integer programming problem. I: The integer programming problem viewed as a knapsack type problem. Operations Research, 16:103\u2013121.","journal-title":"Operations Research"},{"key":"5_CR36","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D. (1994). New worst-case results for the bin-packing problem. Naval Research Logistics, 41:579\u2013585.","journal-title":"Naval Research Logistics"},{"key":"5_CR37","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0377-2217(90)90356-G","volume":"44","author":"H. Stadtler","year":"1990","unstructured":"Stadtler, H. (1990). One-dimensional cutting stock problem in the aluminum industry and its solution. European Journal of Operational Research, 44:209\u2013223.","journal-title":"European Journal of Operational Research"},{"key":"5_CR38","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1057\/jors.1992.101","volume":"43","author":"P. Sweeney","year":"1992","unstructured":"Sweeney, P. and Paternoster, E. (1992). Cutting and packing problems: a categorized, application-orientated research bibliography. Journal of Operational Research Society, 43:691\u2013706.","journal-title":"Journal of Operational Research Society"},{"key":"5_CR39","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"J.M. Val\u00e9rio de Carvalho","year":"1999","unstructured":"Val\u00e9rio de Carvalho, J.M. (1999). Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operational Research, 86:629\u2013659.","journal-title":"Annals of Operational Research"},{"issue":"2","key":"5_CR40","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"J.M. Val\u00e9rio de Carvalho","year":"2002","unstructured":"Val\u00e9rio de Carvalho, J.M. (2002). LP models for bin-packing and cutting stock problems. European Journal of Operational Research, 141(2):253\u2013273.","journal-title":"European Journal of Operational Research"},{"key":"5_CR41","unstructured":"Val\u00e9rio de Carvalho, J.M. (2003). Using extra dual cuts to accelerate column generation. Forthcoming in: INFORMS Journal on Computing."},{"key":"5_CR42","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1016\/0377-2217(95)00024-K","volume":"84","author":"J.M. Val\u00e9rio de Carvalho","year":"1995","unstructured":"Val\u00e9rio de Carvalho, J.M. and Guimar\u00e3es Rodrigues, A.J. (1995). An LP based approach to a two-phase cutting stock problem. European Journal of Operational Research, 84:580\u2013589.","journal-title":"European Journal of Operational Research"},{"key":"5_CR43","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1018346107246","volume":"9","author":"P. Vance","year":"1998","unstructured":"Vance, P. (1998). Branch-and-Price algorithms for the one-dimensional cutting stock problem. Computational Optimization and Applications, 9:211\u2013228.","journal-title":"Computational Optimization and Applications"},{"key":"5_CR44","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s101070050105","volume":"86","author":"F. Vanderbeck","year":"1999","unstructured":"Vanderbeck, F. (1999). Computational study of a column generation algorithm for binpacking and cutting stock problems. Mathematical Programming, Serie A, 86:565\u2013594.","journal-title":"Mathematical Programming"},{"key":"5_CR45","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1287\/opre.48.6.915.12391","volume":"48","author":"F. Vanderbeck","year":"2000","unstructured":"Vanderbeck, F. (2000a). Exact algorithm for minimizing the number of setups in the one-dimensional cutting stock problem. Operations Research, 48:915\u2013926.","journal-title":"Operations Research"},{"key":"5_CR46","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/opre.48.1.111.12453","volume":"48","author":"F. Vanderbeck","year":"2000","unstructured":"Vanderbeck, F. (2000b). On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Operations Research, 48:111\u2013128.","journal-title":"Operations Research"},{"key":"5_CR47","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01539705","volume":"18","author":"G. W\u00e4scher","year":"1996","unstructured":"W\u00e4scher, G. and Gau, T. (1996). Heuristics for the integer one-dimensional cutting stock problem: a computational study. OR Spektrum, 18:131\u2013144.","journal-title":"OR Spektrum"}],"container-title":["Column Generation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-25486-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T18:35:51Z","timestamp":1675103751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/0-387-25486-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9780387254852","9780387254869"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/0-387-25486-2_5","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}