{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:04:12Z","timestamp":1725512652329},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681540"},{"type":"electronic","value":"9783540681557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68155-7_18","type":"book-chapter","created":{"date-parts":[[2008,5,19]],"date-time":"2008-05-19T05:41:20Z","timestamp":1211175680000},"page":"218-232","source":"Crossref","is-referenced-by-count":7,"title":["From High-Level Model to Branch-and-Price Solution in G12"],"prefix":"10.1007","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","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Brand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Achterberg, T.: SCIP - a framework to integrate constraint and mixed integer programming. Technical Report 04-19, Zuse Institute Berlin, (2004), http:\/\/www.zib.de\/Publications\/abstracts\/ZR-04-19\/"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Anbil, R., Forrest, J., Pulleyblank, W.: Column generation and the airline crew pairing problem. In: Documenta Mathematica, Extra Volume ICM (1998)","DOI":"10.4171\/dms\/1-3\/65"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Mathematical Programming\u00a087(3), 385\u2013399 (2000)","journal-title":"Mathematical Programming"},{"issue":"3","key":"18_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.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: Column generation for solving huge integer programs. Operations Research\u00a046(3), 316\u2013329 (1998)","journal-title":"Operations Research"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1016059012379","volume":"108","author":"N. Boland","year":"2001","unstructured":"Boland, N., Surendonk, T.: A column generation approach to delivery planning over time with inhomogeneous service providers and service interval constraints. Annals of Operations Research\u00a0108, 143\u2013156 (2001)","journal-title":"Annals of Operations Research"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-77442-6_6","volume-title":"Practical Aspects of Declarative Languages (PADL 2008)","author":"S. Brand","year":"2008","unstructured":"Brand, S., Duck, G.J., Puchinger, J., Stuckey, P.J.: Flexible, rule-based constraint model linearisation. In: Hudak, P., Warren, D. (eds.) Practical Aspects of Declarative Languages (PADL 2008). LNCS, vol.\u00a04902, pp. 68\u201383. Springer, Heidelberg (2008)"},{"key":"18_CR7","unstructured":"Chabrier, A.: G\u00e9n\u00e9ration de Colonnes et de Coupes utilisant des sous-probl\u00e8mes de plus court chemin. PhD thesis, Universit\u00e9 d\u2019Angers, France (2002)"},{"issue":"1","key":"18_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Operations Research\u00a08(1), 101\u2013111 (1960)","journal-title":"Operations Research"},{"key":"18_CR9","series-title":"GERAD 25th Anniversary Series","volume-title":"Column Generation","year":"2005","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M. (eds.): Column Generation. GERAD 25th Anniversary Series. Springer, Heidelberg (2005)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/11799573_11","volume-title":"Logic Programming","author":"G.J. Duck","year":"2006","unstructured":"Duck, G.J., Stuckey, P.J., Brand, S.: ACD term rewriting. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 117\u2013131. Springer, Heidelberg (2006)"},{"key":"18_CR11","unstructured":"Eremin, A.: Using Dual Values to Integrate Row and Column Generation into Constraint Logic Programming. PhD thesis, Imperial College London (2003)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/11889205_54","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"M. Banda Garcia de la","year":"2006","unstructured":"Garcia de la Banda, M., Marriott, K., Rafeh, R., Wallace, M.: The modelling language Zinc. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 700\u2013705. Springer, Heidelberg (2006)"},{"issue":"3","key":"18_CR13","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/0377-2217(95)00023-J","volume":"84","author":"T. Gau","year":"1995","unstructured":"Gau, T., W\u00e4scher, G.: CUTGEN1: a problem generator for the standard one-dimensional cutting stock problem. European Journal of Operational Research\u00a084(3), 572\u2013579 (1995)","journal-title":"European Journal of Operational Research"},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting-stock problem (part I). Operations Research\u00a09, 849\u2013859 (1961)","journal-title":"Operations Research"},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.1040.0332","volume":"51","author":"O. Gunluk","year":"2005","unstructured":"Gunluk, O., Ladanyi, L., Vries, S.D.: A branch-and-price algorithm and new test problems for spectrum auctions. Management Science\u00a051(3), 391\u2013406 (2005)","journal-title":"Management Science"},{"issue":"11","key":"18_CR16","doi-asserted-by":"publisher","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.: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Software: Practice and Experience\u00a030(11), 1325\u20131352 (2000)","journal-title":"Software: Practice and Experience"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-3-540-48085-3_19","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"U. Junker","year":"1999","unstructured":"Junker, U., Karisch, S.E., Kohl, N., Vaaben, B., Fahle, T., Sellmann, M.: A framework for constraint programming based column generation. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 261\u2013274. Springer, Heidelberg (1999)"},{"issue":"4","key":"18_CR18","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/mnsc.6.4.366","volume":"6","author":"L.V. Kantorovich","year":"1960","unstructured":"Kantorovich, L.V.: Mathematical methods of organizing and planning production. Management Science\u00a06(4), 366\u2013422 (1960)","journal-title":"Management Science"},{"issue":"3","key":"18_CR19","doi-asserted-by":"publisher","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.: Models and bounds for two-dimensional level packing problems. Journal of Combinatorial Optimization\u00a08(3), 363\u2013379 (2004)","journal-title":"Journal of Combinatorial Optimization"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.C.: MINTO, a Mixed INTeger Optimizer. Operations Research Letters\u00a015, 47\u201358 (1994)","journal-title":"Operations Research Letters"},{"key":"18_CR21","unstructured":"Papadakos, N.: Integrated airline scheduling. Computers and Operations Research, available online (August 27, 2007) (to appear, 2007)"},{"issue":"3","key":"18_CR22","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1016\/j.ejor.2005.11.064","volume":"183","author":"J. Puchinger","year":"2007","unstructured":"Puchinger, J., Raidl, G.R.: Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research\u00a0183(3), 1304\u20131327 (2007)","journal-title":"European Journal of Operational Research"},{"key":"18_CR23","unstructured":"Ralphs, T., Ladanyi, L.: COIN\/BCP users manual (2001)"},{"issue":"1","key":"18_CR24","doi-asserted-by":"publisher","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.: Solving VRPTWs with constraint programming based column generation. Annals of Operations Research\u00a0130(1), 199\u2013216 (2004)","journal-title":"Annals of Operations Research"},{"key":"18_CR25","first-page":"269","volume-title":"Computer scheduling of public transport urban passenger vehicle and crew scheduling","author":"D.M. Ryan","year":"1981","unstructured":"Ryan, D.M., Foster, B.: An integer programming approach to scheduling. In: Wren, A. (ed.) Computer scheduling of public transport urban passenger vehicle and crew scheduling, pp. 269\u2013280. North Holland, Amsterdam (1981)"},{"issue":"1-3","key":"18_CR26","doi-asserted-by":"publisher","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.: The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming\u00a029(1-3), 17\u201364 (1996)","journal-title":"Journal of Logic Programming"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11564751_4","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"P.J. Stuckey","year":"2005","unstructured":"Stuckey, P.J., Garcia de la Banda, M., Maher, M.J., Marriott, K., Slaney, J.K., Somogyi, Z., Wallace, M., Walsh, T.: The G12 project: Mapping solver independent models to efficient solutions. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 13\u201316. Springer, Heidelberg (2005)"},{"key":"18_CR28","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-44654-0_4","volume-title":"New Trends in Constraints","author":"P. Hentenryck Van","year":"2000","unstructured":"Van Hentenryck, P., Michel, L.: OPL Script: Composing and controlling models. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS (LNAI), vol.\u00a01865, pp. 75\u201390. Springer, Heidelberg (2000)"},{"key":"18_CR29","unstructured":"Vanderbeck, F.: Branching in branch-and-price: a generic scheme. Technical Report U-05.14, Applied Mathematics, University Bordeaux 1, France (2005)"},{"issue":"1","key":"18_CR30","doi-asserted-by":"publisher","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. Annals of Operations Research\u00a0139(1), 375\u2013388 (2005)","journal-title":"Annals of Operations Research"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-46584-7_20","volume-title":"Practical Aspects of Declarative Languages","author":"T.H. Yunes","year":"2000","unstructured":"Yunes, T.H., Moura, A.V., de Souza, C.C.: A hybrid approach for solving large scale crew scheduling problems. In: Pontelli, E., Santos Costa, V. (eds.) PADL 2000. LNCS, vol.\u00a01753, pp. 207\u2013293. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68155-7_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:04:44Z","timestamp":1684397084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68155-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681540","9783540681557"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68155-7_18","relation":{},"subject":[]}}