{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T01:10:43Z","timestamp":1773709843062,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1023\/a:1018346107246","type":"journal-article","created":{"date-parts":[[2003,2,6]],"date-time":"2003-02-06T17:08:17Z","timestamp":1044551297000},"page":"211-228","source":"Crossref","is-referenced-by-count":109,"title":["Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Pamela H.","family":"Vance","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"150474_CR1","unstructured":"C. Barnhart, C., E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance, \u201cBranch-and-Price: Column Generation for Solving Huge Integer Programs\u201d, Operations Research, to appear."},{"key":"150474_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.23.1.1","volume":"23","author":"M. Desrochers","year":"1989","unstructured":"M. Desrochers, and F. Soumis, \u201cA Column Generation Approach to the Urban Transit Crew Scheduling Problem\u201d, Transportation Science, vol. 23, pp. 1\u201313, 1989.","journal-title":"Transportation Science"},{"key":"150474_CR3","series-title":"Working Paper","volume-title":"Dantzig-Wolfe Decomposition and Column Generation for Integer and Non-convex Programming","author":"J. Desrosiers","year":"1996","unstructured":"J. Desrosiers, P. Hansen, B. Jaumard, F. Soumis, and D. Villeneuve, Dantzig-Wolfe Decomposition and Column Generation for Integer and Non-convex Programming, Working Paper, Ecole des Hautes Etudes Commerciales, Montreal, 1996."},{"key":"150474_CR4","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1287\/opre.38.5.922","volume":"38","author":"A.A. Farley","year":"1990","unstructured":"A.A. Farley, \u201cA Note on Bounding a Class of Linear Programming Problems Including Cutting Stock Problems\u201d, Operations Research, vol. 38, pp. 922\u2013923, 1990.","journal-title":"Operations Research"},{"key":"150474_CR5","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"P.C. Gilmore and R.E. Gomory, \u201cA Linear Programming Approach to the Cutting-Stock Problem\u201d, Operations Research, vol. 9, pp. 849\u2013859, 1961.","journal-title":"Operations Research"},{"key":"150474_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0377-2217(90)90355-F","volume":"44","author":"C. Goulimis","year":"1990","unstructured":"C. Goulimis, \u201cOptimal Solutions for the Cutting Stock Problem,\u201d European Journal of Operational Research, vol. 44, pp. 197\u2013208, 1990.","journal-title":"European Journal of Operational Research"},{"key":"150474_CR7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/321812.321823","volume":"21","author":"E. Horowitz","year":"1974","unstructured":"E. Horowitz and S. Sahni, \u201cComputing Partitions with Applications to the Knapsack Problem,\u201d Journal of ACM, vol. 21, pp. 77\u2013292, 1974.","journal-title":"Journal of ACM"},{"key":"150474_CR8","first-page":"1","volume-title":"Algorithms and Model Formulations in Mathematical Programming","author":"E.L. Johnson","year":"1989","unstructured":"E.L. Johnson, \u201cModeling and Strong Linear Programs for Mixed Integer Programming\u201d, in S.W. Wallace (ed.), Algorithms and Model Formulations in Mathematical Programming, Berlin: Springer-Verlag, pp. 1\u201343, 1989."},{"key":"150474_CR9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF01582013","volume":"33","author":"O. Marcotte","year":"1985","unstructured":"O. Marcotte, \u201cThe Cutting Stock Problem and Integer Rounding\u201d, Mathematical Programming, vol. 33, pp. 82\u201392, 1985.","journal-title":"Mathematical Programming"},{"key":"150474_CR10","unstructured":"M. Parker and J. Ryan, \u201dA column generation algorithm for bandwidth packing,\u201d Telecommunications Systems, to appear."},{"key":"150474_CR11","first-page":"269","volume-title":"Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling","author":"D.M. Ryan","year":"1981","unstructured":"D.M. Ryan, and B.A. Foster, An integer programming approach to scheduling, in A. Wren (ed.), Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, Amsterdam: North-Holland, pp. 269\u2013280, 1981."},{"key":"150474_CR12","series-title":"Technical Report","volume-title":"A Functional Description of MINTO, A Mixed INTeger Optimizer","author":"M.W.P. Savelsbergh","year":"1992","unstructured":"M.W.P. Savelsbergh, G.C. Sigismondi, and G.L. Nemhauser, \u201cA Functional Description of MINTO, A Mixed INTeger Optimizer\u201d, Technical Report, Computational Optimization Center, Institute of Technology, Atlanta, Georgia, 1992."},{"key":"150474_CR13","unstructured":"M.W.P. Savelsbergh, \u201dA Branch-and-Price Algorithm for the Generalized Assignment Problem,\u201d Operations Research, to appear."},{"key":"150474_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01300970","volume":"3","author":"P.H. Vance","year":"1994","unstructured":"P.H. Vance, C. Barnhart, E.L. Johnson, and G.L. Nemhauser, \u201cSolving Binary Cutting Stock Problems by Column Generation and Branch-and-Bound\u201d Computational Optimization and Applications, vol. 3, pp. 111\u2013130, 1994.","journal-title":"Computational Optimization and Applications"},{"key":"150474_CR15","unstructured":"F. Vanderbeck and L.A. Wolsey, \u201dAn Exact Algorithm for IP Column Generation,\u201d Technical Report, CORE, 1994."},{"key":"150474_CR16","volume-title":"Generating Almost Optimal Solutions for the Integer One-dimensional Cutting Stock Problem","author":"G. Wascher","year":"1994","unstructured":"G. Wascher and T. Gau, \u201dGenerating Almost Optimal Solutions for the Integer One-dimensional Cutting Stock Problem,\u201d Arbeitsbericht-Nr. 94\/06, Technischen Universitat Braunschweig, Braunschweig, Germany, 1994."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018346107246.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018346107246\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018346107246.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:12:28Z","timestamp":1752376348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018346107246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["150474"],"URL":"https:\/\/doi.org\/10.1023\/a:1018346107246","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}