{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T08:49:18Z","timestamp":1748854158111,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319180076"},{"type":"electronic","value":"9783319180083"}],"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_14","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T07:32:51Z","timestamp":1429083171000},"page":"199-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Enhancing MIP Branching Decisions by Using the Sample Variance of Pseudo Costs"],"prefix":"10.1007","author":[{"given":"Gregor","family":"Hendel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"14_CR1","unstructured":"(COIN-OR branch-and-cut MIP solver). https:\/\/projects.coin-or.org\/Cbc"},{"key":"14_CR2","unstructured":"(IBM ILOG CPLEX Optimizer). http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"key":"14_CR3","unstructured":"(FICO Xpress-Optimizer). http:\/\/www.fico.com\/en\/Products\/DMTools\/xpress-overview\/Pages\/Xpress-Optimizer.aspx"},{"key":"14_CR4","unstructured":"(GUROBI Optimizer). http:\/\/www.gurobi.com\/products\/gurobi-optimizer\/gurobi-overview"},{"key":"14_CR5","unstructured":"SCIP. Solving Constraint Integer Programs. (http:\/\/scip.zib.de\/)"},{"key":"14_CR6","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, 250\u2013255 (1965)","journal-title":"The Computer Journal"},{"key":"14_CR7","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, 497\u2013520 (1960)","journal-title":"Econometrica"},{"key":"14_CR8","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":"14_CR9","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M B\u00e9nichou","year":"1971","unstructured":"B\u00e9nichou, M., Gauthier, J.M., Girodet, P., Hentges, G., Ribi\u00e8re, G., Vincent, O.: Experiments in mixed-integer programming. Mathematical Programming 1, 76\u201394 (1971)","journal-title":"Mathematical Programming"},{"key":"14_CR10","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 for mixed integer programming. INFORMS Journal on Computing 11, 173\u2013187 (1999)","journal-title":"INFORMS Journal on Computing"},{"key":"14_CR11","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: Finding cuts in the TSP (A preliminary report). Technical Report 95\u201305, DIMACS (1995)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2004","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Operations Research Letters 33, 42\u201354 (2004)","journal-title":"Operations Research Letters"},{"key":"14_CR13","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":"14_CR14","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, 26\u201347 (1977)","journal-title":"Mathematical Programming"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-38171-3_25","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"G Gamrath","year":"2013","unstructured":"Gamrath, G.: Improving strong branching by propagation. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 347\u2013354. Springer, Heidelberg (2013)"},{"key":"14_CR16","first-page":"159","volume":"40","author":"M Fischetti","year":"2012","unstructured":"Fischetti, M., Monaci, M.: Branching on nonchimerical fractionalities. OR Letters 40, 159\u2013164 (2012)","journal-title":"OR Letters"},{"key":"14_CR17","unstructured":"Berthold, T., Gamrath, G., Salvagnin, D.: Cloud branching. Presentation slides from Mixed Integer Programming Workshop at Ohio State University (2014). https:\/\/mip2014.engineering.osu.edu\/sites\/mip2014.engineering.osu.edu\/files\/uploads\/Berthold_MIP2014_Cloud.pdf"},{"key":"14_CR18","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universit\u00e4t Berlin (2007)"},{"key":"14_CR19","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\u201341 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"14_CR20","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, 147\u2013159 (2011)","journal-title":"Discrete Optimization"},{"issue":"4","key":"14_CR21","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s12532-009-0009-1","volume":"1","author":"F Kilin\u00e7 Karzan","year":"2009","unstructured":"Kilin\u00e7 Karzan, F., Nemhauser, G.L., Savelsbergh, M.W.P.: Information-based branching schemes for binary linear mixed integer problems. Mathematical Programming Computation 1(4), 249\u2013293 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"14_CR22","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 & Operations Research 38, 1143\u20131152 (2011)","journal-title":"Computers & Operations Research"},{"key":"14_CR23","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)"},{"key":"14_CR24","unstructured":"Roussas, G.G.: A Course in Mathematical Statistics, Third Edition. Elsevier Science & Technology Books (2014)"},{"key":"14_CR25","unstructured":"SoPlex. An open source LP solver implementing the revised simplex algorithm. (http:\/\/soplex.zib.de\/)"},{"key":"14_CR26","unstructured":"Danna, E.: Performance variability in mixed integer programming. Presentation slides from MIP workshop in New York City (2008). http:\/\/coral.ie.lehigh.edu\/ jeff\/mip-2008\/program.pdf"},{"key":"14_CR27","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, 103\u2013163 (2011)","journal-title":"Mathematical Programming Computation"},{"key":"14_CR28","first-page":"12","volume":"58","author":"RE Bixby","year":"1998","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12\u201315 (1998)","journal-title":"Optima"},{"key":"14_CR29","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, 1\u201312 (2006)","journal-title":"Operations Research Letters"},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-29210-1_12","volume-title":"Operations Research Proceedings 2011","author":"T Achterberg","year":"2012","unstructured":"Achterberg, T., Berthold, T., Hendel, G.: Rounding and propagation heuristics for mixed integer programming. In: Klatte, D., L\u00fcthi, H.J., Schmedders, K. (eds.) Operations Research Proceedings 2011, pp. 71\u201376. Springer, Berlin Heidelberg (2012)"},{"key":"14_CR31","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.orl.2013.08.007","volume":"41","author":"T Berthold","year":"2013","unstructured":"Berthold, T.: Measuring the impact of primal heuristics. Operations Research Letters 41, 611\u2013614 (2013)","journal-title":"Operations Research Letters"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,30]],"date-time":"2020-12-30T20:05:48Z","timestamp":1609358748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18008-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180076","9783319180083"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18008-3_14","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":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}