{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T03:55:35Z","timestamp":1783396535180,"version":"3.54.6"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319180076","type":"print"},{"value":"9783319180083","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18008-3_10","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T07:32:51Z","timestamp":1429083171000},"page":"141-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Branching on Multi-aggregated Variables"],"prefix":"10.1007","author":[{"given":"Gerald","family":"Gamrath","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anna","family":"Melchiori","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timo","family":"Berthold","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ambros M.","family":"Gleixner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Domenico","family":"Salvagnin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497\u2013520 (1960)","journal-title":"Econometrica"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"RJ Dakin","year":"1965","unstructured":"Dakin, R.J.: A tree-search algorithm for mixed integer programming problems. The Computer Journal 8(3), 250\u2013255 (1965)","journal-title":"The Computer Journal"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01584658","volume":"4","author":"G Mitra","year":"1973","unstructured":"Mitra, G.: Investigation of some branch and bound strategies for the solution of mixed integer linear programs. Mathematical Programming 4, 155\u2013170 (1973)","journal-title":"Mathematical Programming"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"JT Linderoth","year":"1999","unstructured":"Linderoth, J.T., Savelsbergh, M.W.P.: A computational study of search strategies in mixed-integer programming. INFORMS Journal on Computing 11(2), 173\u2013187 (1999)","journal-title":"INFORMS Journal on Computing"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Operations Research Letters 33, 42\u201354 (2005)","journal-title":"Operations Research Letters"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-540-68155-7_4","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T Achterberg","year":"2008","unstructured":"Achterberg, T., Berthold, T., Koch, T., Wolter, K.: Constraint integer programming: a new approach to integrate CP and MIP. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 6\u201320. Springer, Heidelberg (2008)"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: Solving constraint integer programs. Mathematical Programming Computation 1(1), 1\u201341 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"10_CR8","first-page":"645","volume":"III","author":"DL Applegate","year":"1998","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: On the solution of traveling salesman problems. Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung, Extra Volume ICM III, 645\u2013656 (1998)","journal-title":"Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung, Extra Volume ICM"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01593767","volume":"12","author":"JM Gauthier","year":"1977","unstructured":"Gauthier, J.M., Ribi\u00e8re, G.: Experiments in mixed-integer linear programming using pseudo-costs. Mathematical Programming 12(1), 26\u201347 (1977)","journal-title":"Mathematical Programming"},{"issue":"3","key":"10_CR10","first-page":"159","volume":"40","author":"M Fischetti","year":"2012","unstructured":"Fischetti, M., Monaci, M.: Branching on nonchimerical fractionalities. OR Letters 40(3), 159\u2013164 (2012)","journal-title":"OR Letters"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-38171-3_3","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T Berthold","year":"2013","unstructured":"Berthold, T., Salvagnin, D.: Cloud branching. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 28\u201343. Springer, Heidelberg (2013)"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s13675-014-0021-8","volume":"2","author":"G Gamrath","year":"2014","unstructured":"Gamrath, G.: Improving strong branching by domain propagation. EURO Journal on Computational Optimization 2(3), 99\u2013122 (2014)","journal-title":"EURO Journal on Computational Optimization"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10107-006-0009-0","volume":"110","author":"J Patel","year":"2007","unstructured":"Patel, J., Chinneck, J.: Active-constraint variable ordering for faster feasibility of mixed integer linear programs. Mathematical Programming 110, 445\u2013474 (2007)","journal-title":"Mathematical Programming"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s12532-009-0009-1","volume":"1","author":"F K\u0131l\u0131n\u00e7 Karzan","year":"2009","unstructured":"K\u0131l\u0131n\u00e7 Karzan, F., Nemhauser, G.L., Savelsbergh, M.W.: Information-based branching schemes for binary linear mixed integer problems. Mathematical Programming Computation 1, 249\u2013293 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-01929-6_23","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T., Berthold, T.: Hybrid branching. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 309\u2013311. Springer, Heidelberg (2009)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-20807-2_15","volume-title":"Integer Programming and Combinatoral Optimization","author":"M Fischetti","year":"2011","unstructured":"Fischetti, M., Monaci, M.: Backdoor branching. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 183\u2013191. Springer, Heidelberg (2011)"},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.disopt.2010.07.001","volume":"8","author":"A Gilpin","year":"2011","unstructured":"Gilpin, A., Sandholm, T.: Information-theoretic approaches to branching in search. Discrete Optimization 8(2), 147\u2013159 (2011)","journal-title":"Discrete Optimization"},{"issue":"8","key":"10_CR18","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.cor.2010.10.025","volume":"38","author":"J Pryor","year":"2011","unstructured":"Pryor, J., Chinneck, J.W.: Faster integer-feasibility in mixed-integer linear programs by branching to force change. Computers & OR 38(8), 1143\u20131152 (2011)","journal-title":"Computers & OR"},{"key":"10_CR19","first-page":"269","volume-title":"Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling","author":"DM Ryan","year":"1981","unstructured":"Ryan, D.M., Foster, B.A.: 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)"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1011207119557","volume":"20","author":"JH Owen","year":"2001","unstructured":"Owen, J.H., Mehrotra, S.: Experimental results on using general disjunctions in branch-and-bound for general-integer linear programs. Computational Optimization and Applications 20, 159\u2013170 (2001)","journal-title":"Computational Optimization and Applications"},{"key":"10_CR21","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-0-387-88843-9_6","volume-title":"Operations Research and Cyber-Infrastructure","author":"A Mahajan","year":"2009","unstructured":"Mahajan, A., Ralphs, T.K.: Experiments with branching using general disjunctions. In: Chinneck, J.W., Kristjansson, B., Saltzman, M.J. (eds.) Operations Research and Cyber-Infrastructure. Operations Research\/Computer Science Interfaces Series, vol. 47, pp. 101\u2013118. Springer, US (2009)"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10107-009-0332-3","volume":"128","author":"M Karamanov","year":"2011","unstructured":"Karamanov, M., Cornu\u00e9jols, G.: Branching on general disjunctions. Mathematical Programming 128, 403\u2013436 (2011)","journal-title":"Mathematical Programming"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-009-0333-2","volume":"130","author":"G Cornu\u00e9jols","year":"2011","unstructured":"Cornu\u00e9jols, G., Liberti, L., Nannicini, G.: Improved strategies for branching on general disjunctions. Mathematical Programming 130, 225\u2013247 (2011)","journal-title":"Mathematical Programming"},{"issue":"8","key":"10_CR24","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1016\/j.cor.2013.03.001","volume":"40","author":"H Mahmoud","year":"2013","unstructured":"Mahmoud, H., Chinneck, J.W.: Achieving milp feasibility quickly using general disjunctions. Computers & OR 40(8), 2094\u20132102 (2013)","journal-title":"Computers & OR"},{"key":"10_CR25","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical report, RAND Corporation (1960)"},{"issue":"5","key":"10_CR26","doi-asserted-by":"publisher","first-page":"2181","DOI":"10.1137\/080737587","volume":"20","author":"A Mahajan","year":"2010","unstructured":"Mahajan, A., Ralphs, T.K.: On the complexity of selecting disjunctions in integer programming. SIAM Journal on Optimization 20(5), 2181\u20132198 (2010)","journal-title":"SIAM Journal on Optimization"},{"issue":"1\u20133","key":"10_CR27","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Mathematical Programming 98(1\u20133), 23\u201347 (2003)","journal-title":"Mathematical Programming"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MWP Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing 6, 445\u2013454 (1994)","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"10_CR29","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BF01580428","volume":"8","author":"AL Brearley","year":"1975","unstructured":"Brearley, A.L., Mitra, G., Williams, H.P.: Analysis of mathematical programming problems prior to applying the simplex algorithm. Mathematical Programming 8(1), 54\u201383 (1975)","journal-title":"Mathematical Programming"},{"issue":"1","key":"10_CR30","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0167-6377(87)90004-6","volume":"6","author":"RE Bixby","year":"1987","unstructured":"Bixby, R.E., Wagner, D.K.: A note on detecting simple redundancies in linear systems. Operation Research Letters 6(1), 15\u201317 (1987)","journal-title":"Operation Research Letters"},{"key":"10_CR31","unstructured":"Gamrath, G., Koch, T., Martin, A., Miltenberger, M., Weninger, D.: Progress in presolving for mixed integer programming. Technical Report 13\u201348, ZIB, Takustr. 7, 14195 Berlin (2013)"},{"key":"10_CR32","first-page":"12","volume":"58","author":"RE Bixby","year":"1998","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12\u201315 (1998)","journal-title":"Optima"},{"issue":"4","key":"10_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Operations Research Letters 34(4), 1\u201312 (2006)","journal-title":"Operations Research Letters"},{"issue":"2","key":"10_CR34","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Mathematical Programming Computation 3(2), 103\u2013163 (2011)","journal-title":"Mathematical Programming Computation"},{"key":"10_CR35","unstructured":"Wunderling, R.: Paralleler und objektorientierter Simplex-Algorithmus. Ph.D. thesis, Technische Universit\u00e4t Berlin (1996)"},{"key":"10_CR36","unstructured":"Baker, K.: Introduction to Sequencing and Scheduling. Wiley (1974)"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Baker, K.R., Trietsch, D.: Principles of Sequencing and Scheduling. Wiley (2009)","DOI":"10.1002\/9780470451793"},{"key":"10_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-38171-3_2","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S Heinz","year":"2013","unstructured":"Heinz, S., Ku, W.-Y., Beck, J.C.: Recent improvements using constraint integer programming for resource allocation and scheduling. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 12\u201327. Springer, Heidelberg (2013)"},{"key":"10_CR39","unstructured":"COR@L: MIP Instances (2014). http:\/\/coral.ie.lehigh.edu\/data-sets\/mixed-integer-instances\/"},{"key":"10_CR40","unstructured":"Gamrath, G., Melchiori, A., Berthold, T., Gleixner, A.M., Salvagnin, D.: Branching on multi-aggregated variables. Technical Report 15\u201310, ZIB, Takustr. 7, 14195 Berlin (2015)"},{"key":"10_CR41","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007)"},{"key":"10_CR42","unstructured":"Gleixner, A.M.: Factorization and update of a reduced basis matrix for the revised simplex method. ZIB-Report 12\u201336, Zuse Institute Berlin, October 2012"},{"key":"10_CR43","unstructured":"Wunderling, R.: The kernel simplex method. Talk at the 21st International Symposium on Mathematical Programming, Berlin, Germany, August 2012"},{"issue":"2","key":"10_CR44","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s12532-010-0015-3","volume":"2","author":"T Achterberg","year":"2010","unstructured":"Achterberg, T., Raack, C.: The MCF-separator: detecting and exploiting multi-commodity flow structures in MIPs. Mathematical Programming Computation 2(2), 125\u2013165 (2010)","journal-title":"Mathematical Programming Computation"},{"key":"10_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-07046-9_3","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"D Salvagnin","year":"2014","unstructured":"Salvagnin, D.: Detecting and exploiting permutation structures in MIPs. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 29\u201344. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18008-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T12:02:54Z","timestamp":1609502574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18008-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180076","9783319180083"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18008-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}