{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:48:35Z","timestamp":1743054515406,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200859"},{"type":"electronic","value":"9783319200866"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_9","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"110-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Separation of Generic Cutting Planes in Branch-and-Price Using a Basis"],"prefix":"10.1007","author":[{"given":"Marco E.","family":"L\u00fcbbecke","sequence":"first","affiliation":[]},{"given":"Jonas T.","family":"Witt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007)","key":"9_CR1"},{"issue":"11","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J Beasley","year":"1990","unstructured":"Beasley, J.: OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"issue":"1\u20132","key":"9_CR3","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-014-0761-5","volume":"149","author":"M Bergner","year":"2015","unstructured":"Bergner, M., Caprara, A., Ceselli, A., Furini, F., L\u00fcbbecke, M., Malaguti, E., Traversi, E.: Automatic Dantzig-Wolfe reformulation of mixed integer programs. Math. Prog. 149(1\u20132), 391\u2013424 (2015)","journal-title":"Math. Prog."},{"key":"9_CR4","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","volume":"149","author":"R Bixby","year":"2007","unstructured":"Bixby, R., Rothberg, E.: Progress in computational mixed integer programming - A look back from the other side of the tipping point. Annals of Operations Research 149(1), 37\u201341 (2007). http:\/\/dx.doi.org\/10.1007\/s10479-006-0091-y","journal-title":"Annals of Operations Research"},{"issue":"5","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1287\/opre.1120.1079","volume":"60","author":"C Bode","year":"2012","unstructured":"Bode, C., Irnich, S.: Cut-first branch-and-price-second for the capacitated arc-routing problem. Oper. Res. 60(5), 1167\u20131182 (2012)","journal-title":"Oper. Res."},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1287\/ijoc.1120.0521","volume":"25","author":"A Caprara","year":"2013","unstructured":"Caprara, A., Furini, F., Malaguti, E.: Uncommon Dantzig-Wolfe reformulation for the temporal knapsack problem. INFORMS J. Comput. 25(3), 560\u2013571 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0377-2217(94)90338-7","volume":"72","author":"DG Cattrysse","year":"1994","unstructured":"Cattrysse, D.G., Salomon, M., Wassenhove, L.N.V.: A set partitioning heuristic for the generalized assignment problem. European J. Oper. Res. 72(1), 167\u2013174 (1994)","journal-title":"European J. Oper. Res."},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0305-0548(96)00032-9","volume":"24","author":"PC Chu","year":"1997","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the generalised assignment problem. Comput. Oper. Res. 24(1), 17\u201323 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"3\u20134","key":"9_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s12532-010-0018-0","volume":"2","author":"S Dash","year":"2010","unstructured":"Dash, S., Goycoolea, M.: A heuristic to generate rank-1 GMI cuts. Math. Program. Comput. 2(3\u20134), 231\u2013257 (2010)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1002\/net.20471","volume":"58","author":"G Desaulniers","year":"2011","unstructured":"Desaulniers, G., Desrosiers, J., Spoorendonk, S.: Cutting planes for branch-and-price algorithms. Networks 58(4), 301\u2013310 (2011)","journal-title":"Networks"},{"doi-asserted-by":"crossref","unstructured":"Desrosiers, J., L\u00fcbbecke, M.E.: Branch-price-and-cut algorithms. In: Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Inc. (2010)","key":"9_CR12","DOI":"10.1002\/9780470400531.eorms0118"},{"unstructured":"Galassi, M., et al.: GNU scientific library reference manual. ISBN 0954612078","key":"9_CR13"},{"unstructured":"Galati, M.: Decomposition methods for integer linear programming. Ph.D. thesis, Lehigh University (2010)","key":"9_CR14"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-13193-6_21","volume-title":"Experimental Algorithms","author":"G Gamrath","year":"2010","unstructured":"Gamrath, G., L\u00fcbbecke, M.E.: Experiments with a generic Dantzig-Wolfe decomposition for integer programs. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 239\u2013252. Springer, Heidelberg (2010)"},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1057\/jors.1968.104","volume":"19","author":"AS Goncalves","year":"1968","unstructured":"Goncalves, A.S.: Basic feasible solutions and the Dantzig-Wolfe decomposition algorithm. J. Oper. Res. Soc. 19(4), 465\u2013469 (1968)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1287\/ijoc.1090.0341","volume":"22","author":"S Irnich","year":"2010","unstructured":"Irnich, S., Desaulniers, G., Desrosiers, J., Hadjar, A.: Path-reduced costs for eliminating arcs in routing and scheduling. INFORMS J. Comput. 22(2), 297\u2013313 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01720977","volume":"17","author":"IH Osman","year":"1995","unstructured":"Osman, I.H.: Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches. OR Spectrum 17(4), 211\u2013225 (1995)","journal-title":"OR Spectrum"},{"unstructured":"Poggi de Arag\u00e3o, M., Uchoa, E.: Integer program reformulation for robust branch-and-cut-and-price. In: Mathematical Programming in Rio: A Conference in Honour of Nelson Maculan, pp. 56\u201361 (2003)","key":"9_CR19"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10601-009-9085-0","volume":"16","author":"J Puchinger","year":"2011","unstructured":"Puchinger, J., Stuckey, P., Wallace, M., Brand, S.: Dantzig-Wolfe decomposition and branch-and-price solving in G12. Constraints 16(1), 77\u201399 (2011)","journal-title":"Constraints"},{"unstructured":"Ralphs, T., Galati, M.: DIP - Decomposition for integer programming (2009). https:\/\/projects.coin-or.org\/Dip","key":"9_CR21"},{"unstructured":"Range, T.: An integer cutting-plane procedure for the Dantzig-Wolfe decomposition: Theory. Discussion Papers on Business and Economics 10\/2006, Dept. Business and Economics. University of Southern Denmark (2006)","key":"9_CR22"},{"issue":"1","key":"9_CR23","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s11590-012-0546-9","volume":"8","author":"J Rios","year":"2014","unstructured":"Rios, J., Ross, K.: Converging upon basic feasible solutions through Dantzig-Wolfe decomposition. Optim. Lett. 8(1), 171\u2013180 (2014)","journal-title":"Optim. Lett."},{"issue":"5","key":"9_CR24","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1287\/mnsc.42.5.738","volume":"42","author":"H Tempelmeier","year":"1996","unstructured":"Tempelmeier, H., Derstroff, M.: A lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Science 42(5), 738\u2013757 (1996)","journal-title":"Management Science"},{"unstructured":"Vanderbeck, F.: BaPCod - A generic branch-and-price code (2005). https:\/\/wiki.bordeaux.inria.fr\/realopt\/pmwiki.php\/Project\/BaPCod","key":"9_CR25"},{"issue":"3","key":"9_CR26","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.orl.2005.05.009","volume":"34","author":"F Vanderbeck","year":"2006","unstructured":"Vanderbeck, F., Savelsbergh, M.: A generic view of Dantzig-Wolfe decomposition in mixed integer programming. Oper. Res. Lett. 34(3), 296\u2013306 (2006)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:18:14Z","timestamp":1674227894000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}