{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T09:35:25Z","timestamp":1776764125468,"version":"3.51.2"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,1,5]],"date-time":"2010-01-05T00:00:00Z","timestamp":1262649600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10107-009-0334-1","type":"journal-article","created":{"date-parts":[[2010,1,4]],"date-time":"2010-01-04T01:28:23Z","timestamp":1262568503000},"page":"249-294","source":"Crossref","is-referenced-by-count":65,"title":["Branching in branch-and-price: a generic scheme"],"prefix":"10.1007","volume":"130","author":[{"given":"Fran\u00e7ois","family":"Vanderbeck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,1,5]]},"reference":[{"issue":"2","key":"334_CR1","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C. Barnhart","year":"2000","unstructured":"Barnhart C., Hane C.A., Vance P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2), 318\u2013326 (2000)","journal-title":"Oper. Res."},{"key":"334_CR2","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.L., Savelsbergh M.W.P., Vance P.H.: Branch-and-price: column generation for huge integer programs. Oper. Res. 46, 316\u2013329 (1998)","journal-title":"Oper. Res."},{"key":"334_CR3","unstructured":"Belov, G., Letchford, A.N., Uchoa, E.: A node-flow model for the 1D stock cutting: Robust branch-cut-and-price. Tech. report RPEP, vol. 5, no. 7. Universidade Federal Fluminense (2005)"},{"issue":"2","key":"334_CR4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10107-006-0079-z","volume":"113","author":"O. Briant","year":"2008","unstructured":"Briant O., Lemar\u00e9chal C., Meurdesoif Ph., Michel S., Perrot N., Vanderbeck F.: Comparison of bundle and classical column generation. Math. Progr. 113(2), 299\u2013344 (2008)","journal-title":"Math. Progr."},{"key":"334_CR5","unstructured":"Chabrier, A.: G\u00e9n\u00e9ration de Colonnes et de Coupes utilisant des sous-probl\u00e8mes de plus court chemin. Th\u00e8se de doctorat, Universit\u00e9 d\u2019Angers (2003)"},{"key":"334_CR6","unstructured":"Desaulniers, G., Desrosiers, J., Langevin, A., Marcotte, O., Savard, G., Soumis, F., Solomon, M.: GENCOL, a mathematical optimizer. http:\/\/www.crt.umontreal.ca\/~gencol\/gceng.html (1990)"},{"issue":"5","key":"334_CR7","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.orl.2005.09.008","volume":"34","author":"F. Eisenbrand","year":"2006","unstructured":"Eisenbrand F., Shmonin G.: Carath\u00e9odory bounds for integer cones. Oper. Res. Lett. 34(5), 564\u2013568 (2006)","journal-title":"Oper. Res. Lett."},{"key":"334_CR8","unstructured":"Gendreau, M., Dejaxm, P., Feillet, D., Gueguen, C.: Vehicle routing with time windows and split deliveries, Working Paper (2005)"},{"key":"334_CR9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A. Geoffrion","year":"1974","unstructured":"Geoffrion A.: Lagrangian relaxation for integer programming. Math. Prog. St. 2, 82\u2013114 (1974)","journal-title":"Math. Prog. St."},{"key":"334_CR10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E. Horowitz","year":"1974","unstructured":"Horowitz E., Sahni S.: Computing partitions with applications to the knapsack problem. J. ACM 21, 277\u2013292 (1974)","journal-title":"J. ACM"},{"key":"334_CR11","first-page":"223","volume-title":"Computational Combinatorial Optimization","author":"L. Lad\u00e1nyi","year":"1998","unstructured":"Lad\u00e1nyi L., Ralphs T.K., Trotter L.E. Jr: Branch, cut, and price: sequential and parallel. In: J\u00fcnger, M., Naddef, D. (eds) Computational Combinatorial Optimization, pp. 223\u2013269. Springer, New York (1998)"},{"key":"334_CR12","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF02109857","volume":"2","author":"M. Parker","year":"1994","unstructured":"Parker M., Ryan D.M.: A column generation algorithm for brandwidth packing. Telecommun. Syst. 2, 185\u2013195 (1994)","journal-title":"Telecommun. Syst."},{"key":"334_CR13","doi-asserted-by":"crossref","unstructured":"Puchinger, J., Stuckey, P.J., Wallace, M., Brand, S.: From high-level model to branch-and-price solution in G12. CPAIOR 2008, The Fifth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, vol. 5015 of LNCS, pp. 218\u2013232. Springer, New York (2008)","DOI":"10.1007\/978-3-540-68155-7_18"},{"key":"334_CR14","unstructured":"Ryan, D.M., Foster, B.A.: An integer programming approach to scheduling. In: Wren, A. (eds.) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pp. 269\u2013280. North-Holland (1981)"},{"key":"334_CR15","unstructured":"Savelsbergh, M.W.P., Nemhauser, G.L.: Functional description of MINTO, a mixed INTeger optimizer. Report COC-91-03A, Georgia Institute of Technology, Atlanta (1993)"},{"key":"334_CR16","unstructured":"Thienel, S.: ABACUS\u2014a branch-and-cut system. Ph.D. Thesis, Universit\u00e4t zu K\u00f6ln (1995)"},{"key":"334_CR17","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"J. Val\u00e9rio de Carvalho","year":"1999","unstructured":"Val\u00e9rio de Carvalho J.: Exact solution of bin packing problems using column generation and branch-and-bound. Ann. Oper. Res 86, 629\u2013659 (1999)","journal-title":"Ann. Oper. Res"},{"issue":"3","key":"334_CR18","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1018346107246","volume":"9","author":"P.H. Vance","year":"1998","unstructured":"Vance P.H.: Branch-and-price algorithms for the one-dimensional cutting stock problem. Comput. Optim. Appl. 9(3), 211\u2013228 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"334_CR19","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s101070050105","volume":"86","author":"F. Vanderbeck","year":"1999","unstructured":"Vanderbeck F.: Computational study of a column generation algorithm for bin packing and cutting stock problems. Math. Prog. 86, 565\u2013594 (1999)","journal-title":"Math. Prog."},{"key":"334_CR20","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/opre.48.1.111.12453","volume":"48","author":"F. Vanderbeck","year":"2000","unstructured":"Vanderbeck F.: On Dantzig\u2013Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper. Res. 48, 111\u2013128 (2000)","journal-title":"Oper. Res."},{"key":"334_CR21","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1287\/opre.48.6.915.12391","volume":"48","author":"F. Vanderbeck","year":"2000","unstructured":"Vanderbeck F.: Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Oper. Res. 48, 915\u2013926 (2000)","journal-title":"Oper. Res."},{"issue":"1","key":"334_CR22","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-002-0300-7","volume":"94","author":"F. Vanderbeck","year":"2002","unstructured":"Vanderbeck F.: Extending Dantzig\u2019s bound to the bounded multi-class binary knapsack problem. Math. Prog. 94(1), 125\u2013136 (2002)","journal-title":"Math. Prog."},{"key":"334_CR23","volume-title":"Column Generation","author":"F. Vanderbeck","year":"2005","unstructured":"Vanderbeck F.: Implementing mixed integer column generation. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds) Column Generation, Kluwer, Dordrecht (2005)"},{"key":"334_CR24","unstructured":"Vanderbeck, F.: BaPCod\u2014a generic branch-and-price code. depot APP 08-120018-000 IDDN (2008). http:\/\/wiki.bordeaux.inria.fr\/realopt\/"},{"issue":"3","key":"334_CR25","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.orl.2005.05.009","volume":"34","author":"F. Vanderbeck","year":"2006","unstructured":"Vanderbeck F., Savelsbergh M.W.P.: A Generic view of Dantzig\u2013Wolfe decomposition in mixed integer programming. Oper. Res. Let. 34(3), 296\u2013306 (2006)","journal-title":"Oper. Res. Let."},{"issue":"1","key":"334_CR26","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10479-005-3455-9","volume":"139","author":"D. Villeneuve","year":"2005","unstructured":"Villeneuve D., Desrosiers J., L\u00fcbbecke M.E., Soumis F.: On compact formulations for integer programs solved by column generation. Ann. Oper. Res. 139(1), 375\u2013388 (2005)","journal-title":"Ann. Oper. Res."},{"key":"334_CR27","unstructured":"Xpress-MP: User guide and reference manual, release 18.10. Dash Optim. (2007)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0334-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-009-0334-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0334-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:07Z","timestamp":1559123407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-009-0334-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,5]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["334"],"URL":"https:\/\/doi.org\/10.1007\/s10107-009-0334-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,5]]}}}