{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:31:14Z","timestamp":1759847474002},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,19]],"date-time":"2009-11-19T00:00:00Z","timestamp":1258588800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s10601-009-9085-0","type":"journal-article","created":{"date-parts":[[2009,11,18]],"date-time":"2009-11-18T13:58:30Z","timestamp":1258552710000},"page":"77-99","source":"Crossref","is-referenced-by-count":18,"title":["Dantzig-Wolfe decomposition and branch-and-price solving in G12"],"prefix":"10.1007","volume":"16","author":[{"given":"Jakob","family":"Puchinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark G.","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Brand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,19]]},"reference":[{"key":"9085_CR1","unstructured":"Achterberg, T. (2007). Constraint integer programming. PhD thesis, Technische Universit\u00e4t Berlin."},{"key":"9085_CR2","doi-asserted-by":"crossref","unstructured":"Anbil, R., Forrest, J., & Pulleyblank, W. (1998). Column generation and the airline crew pairing problem. In Documenta mathematica, extra volume ICM.","DOI":"10.4171\/dms\/1-3\/65"},{"issue":"3","key":"9085_CR3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F Barahona","year":"2000","unstructured":"Barahona, F., & Anbil, R. (2000). The volume algorithm: Producing primal solutions with a subgradient method. Mathematical Programming, 87(3), 385\u2013399.","journal-title":"Mathematical Programming"},{"issue":"3","key":"9085_CR4","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.\u00a0L., Nemhauser, G.\u00a0L., Savelsbergh, M.\u00a0W.\u00a0P., & Vance, P.\u00a0H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46(3), 316\u2013329.","journal-title":"Operations Research"},{"key":"9085_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1016059012379","volume":"108","author":"N Boland","year":"2001","unstructured":"Boland, N., & Surendonk, T. (2001). A column generation approach to delivery planning over time with inhomogeneous service providers and service interval constraints. Annals of Operations Research, 108, 143\u2013156.","journal-title":"Annals of Operations Research"},{"key":"9085_CR6","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/978-3-540-77442-6_6","volume-title":"Practical aspects of declarative languages (PADL\u201908)","author":"S Brand","year":"2008","unstructured":"Brand, S., Duck, G.\u00a0J., Puchinger, J., & Stuckey, P.\u00a0J. (2008). Flexible, rule-based constraint model linearisation. In P.\u00a0Hudak, & D.\u00a0Warren (Eds.), Practical aspects of declarative languages (PADL\u201908). LNCS (Vol.\u00a04902, pp. 68\u201383). New York: Springer."},{"key":"9085_CR7","unstructured":"Chabrier, A. (2002). G\u00e9n\u00e9ration de colonnes et de coupes utilisant des sous-probl\u00e8mes de plus court chemin. PhD thesis, Universit\u00e9 d\u2019Angers, France."},{"issue":"1","key":"9085_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.\u00a0B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101\u2013111.","journal-title":"Operations Research"},{"key":"9085_CR9","volume-title":"Column generation","year":"2005","unstructured":"Desaulniers, G., Desrosiers, J., & Solomon, M. (Eds.) (2005). Column generation. GERAD 25th Anniversary Series. New York: Springer."},{"key":"9085_CR10","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/11799573_11","volume-title":"Logic programming (ICLP 2006)","author":"GJ Duck","year":"2006","unstructured":"Duck, G.\u00a0J., Stuckey, P.\u00a0J., & Brand, S. (2006). ACD term rewriting. In S.\u00a0Etalle, & M.\u00a0Truszczynski (Eds.), Logic programming (ICLP 2006). LNCS (Vol. 4079, pp. 117\u2013131). New York: Springer."},{"key":"9085_CR11","unstructured":"ECL i PS e (2009). www.eclipse-clp.org ."},{"key":"9085_CR12","unstructured":"Eremin, A. (2003). Using dual values to integrate row and column generation into constraint logic programming. PhD thesis, Imperial College London."},{"key":"9085_CR13","series-title":"LNCS","first-page":"700","volume-title":"Principles and practice of constraint programming (CP\u201906)","author":"MJ Garcia de la Banda","year":"2006","unstructured":"Garcia de la Banda, M.\u00a0J., Marriott, K., Rafeh, R., & Wallace, M. (2006). The modelling language Zinc. In F.\u00a0Benhamou (Ed.), Principles and practice of constraint programming (CP\u201906). LNCS (Vol. 4204, pp. 700\u2013705). New York: Springer."},{"issue":"3","key":"9085_CR14","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., & W\u00e4scher, G. (1995). CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem. European Journal of Operational Research, 84(3), 572\u2013579.","journal-title":"European Journal of Operational Research"},{"key":"9085_CR15","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P.\u00a0C., & Gomory, R.\u00a0E. (1961). A linear programming approach to the cutting-stock problem (part I). Operations Research, 9, 849\u2013859.","journal-title":"Operations Research"},{"issue":"3","key":"9085_CR16","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.1040.0332","volume":"51","author":"O Gunluk","year":"2005","unstructured":"Gunluk, O., Ladanyi, L., & Vries, S.\u00a0D. (2005). A branch-and-price algorithm and new test problems for spectrum auctions. Management Science, 51(3), 391\u2013406.","journal-title":"Management Science"},{"issue":"11","key":"9085_CR17","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"M J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., & Thienel, S. (2000). The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Software: Practice and Experience, 30(11), 1325\u20131352.","journal-title":"Software: Practice and Experience"},{"key":"9085_CR18","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-3-540-48085-3_19","volume-title":"Principles and practice of constraint programming (CP\u201999)","author":"U Junker","year":"1999","unstructured":"Junker, U., Karisch, S.\u00a0E., Kohl, N., Vaaben, B., Fahle, T., & Sellmann, M. (1999). A framework for constraint programming based column generation. In J.\u00a0Jaffar (Ed.), Principles and practice of constraint programming (CP\u201999). LNCS (Vol. 1713, pp. 261\u2013274). New York: Springer."},{"issue":"4","key":"9085_CR19","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/mnsc.6.4.366","volume":"6","author":"LV Kantorovich","year":"1960","unstructured":"Kantorovich, L.\u00a0V. (1960). Mathematical methods of organizing and planning production. Management Science, 6(4), 366\u2013422.","journal-title":"Management Science"},{"issue":"3","key":"9085_CR20","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/B:JOCO.0000038915.62826.79","volume":"8","author":"A Lodi","year":"2004","unstructured":"Lodi, A., Martello, S., & Vigo, D. (2004). Models and bounds for two-dimensional level packing problems. Journal of Combinatorial Optimization, 8(3), 363\u2013379.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"6","key":"9085_CR21","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"M L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M., & Desrosiers, J. (2005). Selected topics in column generation. Operations Research, 53(6), 1007\u20131023.","journal-title":"Operations Research"},{"key":"9085_CR22","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"GL Nemhauser","year":"1994","unstructured":"Nemhauser, G.\u00a0L., Savelsbergh, M.\u00a0W.\u00a0P., & Sigismondi, G.\u00a0C. (1994). MINTO, a Mixed INTeger Optimizer. Operations Research Letters, 15, 47\u201358.","journal-title":"Operations Research Letters"},{"key":"9085_CR23","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.cor.2007.08.002","volume":"36","author":"N Papadakos","year":"2009","unstructured":"Papadakos, N. (2009). Integrated airline scheduling. Computers and Operations Research, 36, 176\u2013195 (to appear). Available online 27 August 2007.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"9085_CR24","doi-asserted-by":"crossref","first-page":"1304","DOI":"10.1016\/j.ejor.2005.11.064","volume":"183","author":"J Puchinger","year":"2007","unstructured":"Puchinger, J., & Raidl, G.\u00a0R. (2007). Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research, 183(3), 1304\u20131327.","journal-title":"European Journal of Operational Research"},{"key":"9085_CR25","unstructured":"Ralphs, T., & Ladanyi, L. (2001). COIN\/BCP user\u2019s manual."},{"issue":"1","key":"9085_CR26","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/B:ANOR.0000032576.73681.29","volume":"130","author":"L-M Rousseau","year":"2004","unstructured":"Rousseau, L.-M., Gendreau, M., Pesant, G., & Focacci, F. (2004). Solving VRPTWs with constraint programming based column generation. Annals of Operations Research, 130(1), 199\u2013216.","journal-title":"Annals of Operations Research"},{"key":"9085_CR27","first-page":"269","volume-title":"Computer scheduling of public transport urban passenger vehicle and crew scheduling","author":"DM Ryan","year":"1981","unstructured":"Ryan, D.\u00a0M., & Foster, B. (1981). An integer programming approach to scheduling. In A.\u00a0Wren (Ed.), Computer scheduling of public transport urban passenger vehicle and crew scheduling (pp.\u00a0269\u2013280). Amsterdam: North Holland."},{"issue":"1\u20133","key":"9085_CR28","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z Somogyi","year":"1996","unstructured":"Somogyi, Z., Henderson, F., & Conway, T. (1996). The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1\u20133), 17\u201364.","journal-title":"Journal of Logic Programming"},{"key":"9085_CR29","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/11564751_4","volume-title":"Principles and practice of constraint programming (CP\u201905)","author":"PJ Stuckey","year":"2005","unstructured":"Stuckey, P.\u00a0J., de\u00a0la Banda, M.\u00a0J.\u00a0G., Maher, M.\u00a0J., Marriott, K., Slaney, J.\u00a0K., Somogyi, Z., et al. (2005). The G12 project: Mapping solver independent models to efficient solutions. In P.\u00a0van Beek (Ed.), Principles and practice of constraint programming (CP\u201905). LNCS (Vol.\u00a03709, pp.\u00a013\u201316). New York: Springer."},{"key":"9085_CR30","series-title":"LNCS","first-page":"75","volume-title":"New trends in constraints","author":"P Hentenryck Van","year":"1999","unstructured":"Van Hentenryck, P., & Michel, L. (1999). OPL script: Composing and controlling models. In K.\u00a0R. Apt, A.\u00a0C. Kakas, E.\u00a0Monfroy, & F.\u00a0Rossi (Eds.), New trends in constraints. LNCS (Vol.\u00a01865, pp.\u00a075\u201390). New York: Springer."},{"key":"9085_CR31","volume-title":"Constraint-based local search","author":"P Hentenryck Van","year":"2005","unstructured":"Van Hentenryck, P., & Michel, L. (2005). Constraint-based local search. Cambridge: MIT."},{"key":"9085_CR32","unstructured":"Vanderbeck, F. (2005). Branching in branch-and-price: A generic scheme. Technical Report U-05.14, Applied Mathematics, University Bordeaux 1, France."},{"issue":"1","key":"9085_CR33","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.\u00a0E., & Soumis, F. (2005). On compact formulations for integer programs solved by column generation. Annals of Operations Research, 139(1), 375\u2013388.","journal-title":"Annals of Operations Research"},{"key":"9085_CR34","unstructured":"Yunes, T., Aron, I., & Hooker, J. (2009). An integrated solver for optimization problems (updated on 6\/10\/09). Technical report, University of Miami."},{"key":"9085_CR35","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/3-540-46584-7_20","volume-title":"Practical aspects of declarative languages (PADL\u201900)","author":"TH Yunes","year":"2000","unstructured":"Yunes, T.\u00a0H., Moura, A.\u00a0V., & de\u00a0Souza, C.\u00a0C. (2000). A hybrid approach for solving large scale crew scheduling problems. In Practical aspects of declarative languages (PADL\u201900). LNCS (Vol.\u00a01753, pp.\u00a0293\u2013207). New York: Springer."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-009-9085-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-009-9085-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-009-9085-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T15:58:36Z","timestamp":1685203116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-009-9085-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,19]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["9085"],"URL":"https:\/\/doi.org\/10.1007\/s10601-009-9085-0","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,19]]}}}