{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T01:10:05Z","timestamp":1773709805911,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1007\/bf01300970","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T06:11:38Z","timestamp":1111731098000},"page":"111-130","source":"Crossref","is-referenced-by-count":153,"title":["Solving binary cutting stock problems by column generation and branch-and-bound"],"prefix":"10.1007","volume":"3","author":[{"given":"Pamela H.","family":"Vance","sequence":"first","affiliation":[]},{"given":"Cynthia","family":"Barnhart","sequence":"additional","affiliation":[]},{"given":"Ellis L.","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"M. Desrochers, J. Desrosiers, and M. Solomon. ?A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows,?Operations Research 40, 542?354, 1992.","journal-title":"Operations Research"},{"key":"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. ?A Column Generation Approach to the Urban Transit Crew Scheduling Problem,?Transportation Science 23, 1?13, 1989.","journal-title":"Transportation Science"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1002\/net.3230140406","volume":"14","author":"J. Desrosiers","year":"1984","unstructured":"J. Desrosiers, F. Soumis, and M. Desrochers. ?Routing with Time Windows by Column Generation?Networks 14, 545?565, 1984.","journal-title":"Networks"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0377-2217(86)90243-2","volume":"23","author":"J. Desrosiers","year":"1986","unstructured":"J. Desrosiers, F. Soumis, M. Desrochers, and M., Sauve. ?Methods for Routing with Time Windows,?European Journal of Operational Research 23, 235?245, 1986.","journal-title":"European Journal of Operational Research"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y. Dumas","year":"1991","unstructured":"Y. Dumas, J. Desrosiers, and F. Soumis, ?Pickup and Delivery Models with Time Windows,?European Journal of Operational Research 54, 7?22, 1991.","journal-title":"European Journal of Operational Research"},{"key":"CR6","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. ?A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems,?Operations Research 38, 922?923, 1990.","journal-title":"Operations Research"},{"key":"CR7","unstructured":"M.R. Garey and D.S. Johnson.Computers and Intractability: A Guide to the Theory of NP Completeness, W.H. Freeman, 1979."},{"key":"CR8","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, ?A Linear Programming Approach to the Cutting-Stock Problem,?Operations Research 9, 849?859, 1961.","journal-title":"Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0377-2217(90)90355-F","volume":"44","author":"C. Goulimis","year":"1990","unstructured":"C. Goulimis, ?Optimal Solutions for the Cutting Stock Problem,?European Journal of Operational Research 44, 197?208, 1990.","journal-title":"European Journal of Operational Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0377-2217(91)90293-5","volume":"54","author":"R.W. Haessler","year":"1991","unstructured":"R.W. Haessler and P.E. Sweeney, ?Cutting Stock Problems and Solution Procedures,?European Journal of Operational Research 54, 141?150, 1991.","journal-title":"European Journal of Operational Research"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E. Horowitz","year":"1974","unstructured":"E. Horowitz and S. Sahni, ?Computing Partitions with Applications to the Knapsack Problem,?Journal of ACM 21, 277?292, 1974.","journal-title":"Journal of ACM"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"E.L. Johnson ?Modeling and Strong Linear Programs for Mixed Integer Programming,?Algorithms and Model Formulations in Mathematical Programming, S.W. Wallace ed., Springer-Verlag, 1?43, 1989.","DOI":"10.1007\/978-3-642-83724-1_1"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0167-6377(81)90019-5","volume":"1","author":"E.L. Johnson","year":"1981","unstructured":"E.L. Johnson and M.W. Padberg, ?A Note on the Knapsack Problem with Special Ordered Sets,?Operations Research Letters 1, 18?22, 1981.","journal-title":"Operations Research Letters"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF01582013","volume":"33","author":"O. Marcotte","year":"1985","unstructured":"O. Marcotte, ?The Cutting Stock Problem and Integer Rounding,?Mathematical Programming 33, 82?92, 1985.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0167-6377(86)90009-X","volume":"4","author":"O. Marcotte","year":"1986","unstructured":"O. Marcotte. ?An Instance of the Cutting Stock Problem, for which the Integer Rounding Property Does Not Hold,?Operations Research Letters 4, 239?243, 1986.","journal-title":"Operations Research Letters"},{"key":"CR16","unstructured":"S. Martello and P. Toth.Knapsack Problems: Algorithms and Computer Implementations, Wiley, 1990."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0167-6377(91)90003-8","volume":"10","author":"G.L. Nemhauser","year":"1991","unstructured":"G.L. Nemhauser and S. Park. ?A Polyhedral Approach to Edge Coloring,?Operations Research Letters, 10, 315?322, 1991.","journal-title":"Operations Research Letters"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0377-2217(89)90389-5","volume":"41","author":"C.C. Ribeiro","year":"1989","unstructured":"C.C. Ribeiro, M. Minoux, and M.C. Penna. ?An Optimal Column-Generation-with-Ranking, Algorithm for Very, Large Scale Set Partitioning Problems in Traffic Assignment,?European Journal of Operational Research 41, 232?239, 1989.","journal-title":"European Journal of Operational Research"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/0305-0548(86)90077-8","volume":"13","author":"G.M. Roodman","year":"1986","unstructured":"G.M. Roodman, ?Near-Optimal Solutions to One-dimensional Cutting Stock Problems,?Computers and Operations Research 13, 713?719, 1986.","journal-title":"Computers and Operations Research"},{"key":"CR20","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. ?A Functional Description of MINTO, A Mixed INTeger Optimizer,? Technical Report, Computational Optimization Center, Georgia Institute of Technology, Atlanta, 1992."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0377-2217(90)90356-G","volume":"44","author":"H. Stadtler","year":"1990","unstructured":"H. Stadtler, ?A One-dimensional Cutting Stock Problem in the Aluminum Industry and its Solution,?European Journal of Operational Research 44, 209?223, 1990.","journal-title":"European Journal of Operational Research"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01300970.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01300970\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01300970","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:52:53Z","timestamp":1586181173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01300970"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["BF01300970"],"URL":"https:\/\/doi.org\/10.1007\/bf01300970","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}