{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:44:03Z","timestamp":1725900243842},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_20","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T09:23:02Z","timestamp":1368004982000},"page":"212-223","source":"Crossref","is-referenced-by-count":0,"title":["Undercover Branching"],"prefix":"10.1007","author":[{"given":"Timo","family":"Berthold","sequence":"first","affiliation":[]},{"given":"Ambros M.","family":"Gleixner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A.H. Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica\u00a028(3), 497\u2013520 (1960)","journal-title":"Econometrica"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Bixby, R., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice \u2013 closing the gap. In: Powell, M., Scholtes, S. (eds.) Systems Modelling and Optimization: Methods, Theory, and Applications, pp. 19\u201349. Kluwer Academic Publisher (2000)","DOI":"10.1007\/978-0-387-35514-6_2"},{"key":"20_CR3","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, TU Berlin (2007)"},{"key":"20_CR4","unstructured":"Vigerske, S.: Decomposition in Multistage Stochastic Programming and a Constraint Integer Programming Approach to MINLP. PhD thesis, HU Berlin (2012)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P. Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optimization Methods & Software\u00a024, 597\u2013634 (2009)","journal-title":"Optimization Methods & Software"},{"issue":"1-2","key":"20_CR6","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. Math. Prog.\u00a0128(1-2), 403\u2013436 (2011)","journal-title":"Math. Prog."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M. Benichou","year":"1971","unstructured":"Benichou, M., Gauthier, J., Girodet, P., Hentges, G., Ribiere, G., Vincent, O.: Experiments in mixed-integer programming. Math. Prog.\u00a01, 76\u201394 (1971)","journal-title":"Math. Prog."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"J.T. Linderoth","year":"1999","unstructured":"Linderoth, J.T., Savelsbergh, M.W.P.: A computational study of search strategies for mixed integer programming. INFORMS J. Comput.\u00a011, 173\u2013187 (1999)","journal-title":"INFORMS J. Comput."},{"key":"20_CR9","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: Finding cuts in the TSP (A preliminary report). Technical Report 95-05, DIMACS (1995)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, USA (2007)","DOI":"10.1515\/9781400841103"},{"key":"20_CR11","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\u00a033, 42\u201354 (2005)","journal-title":"Operations Research Letters"},{"key":"20_CR12","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.\u00a05547, pp. 309\u2013311. Springer, Heidelberg (2009)"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. of the DAC (July 2001)","DOI":"10.1145\/378239.379017"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","first-page":"342","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"C.M. Li","year":"1997","unstructured":"Li, C.M., Anbulagan: Look-ahead versus look-back for satisfiability problems. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 342\u2013356. Springer, Heidelberg (1997)"},{"issue":"4","key":"20_CR15","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.P.: Information-based branching schemes for binary linear mixed-integer programs. Math. Prog. Computation\u00a01(4), 249\u2013293 (2009)","journal-title":"Math. Prog. Computation"},{"key":"20_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.\u00a06655, pp. 183\u2013191. Springer, Heidelberg (2011)"},{"issue":"3","key":"20_CR17","first-page":"159","volume":"40","author":"M. Fischetti","year":"2012","unstructured":"Fischetti, M., Monaci, M.: Branching on nonchimerical fractionalities. OR Letters\u00a040(3), 159\u2013164 (2012)","journal-title":"OR Letters"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M. Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Math. Prog.\u00a099, 563\u2013591 (2004)","journal-title":"Math. Prog."},{"key":"20_CR19","unstructured":"Berthold, T., Gleixner, A.M.: Undercover \u2013 a primal heuristic for MINLP based on sub-MIPs generated by set covering. In: Bonami, P., Liberti, L., Miller, A.J., Sartenaer, A. (eds.) Proc. of the EWMINLP, pp. 103\u2013112 (April 2010)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Berthold, T., Gleixner, A.M.: Undercover: a primal MINLP heuristic exploring a largest sub-MIP. Math. Prog. (2013) doi:10.1007\/s10107-013-0635-2","DOI":"10.1007\/s10107-013-0635-2"},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"M.R. Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib \u2013 a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput.\u00a015(1), 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"key":"20_CR22","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"20_CR23","unstructured":"SCIP: Solving Constraint Integer Programs, http:\/\/scip.zib.de"},{"key":"20_CR24","unstructured":"CppAD: A Package for Differentiation of C++ Algorithms, http:\/\/www.coin-or.org\/CppAD"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Berthold, T., Heinz, S., Vigerske, S.: Extending a CIP framework to solve MIQCPs. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications, vol.\u00a0154, pp. 427\u2013444. Springer (2012)","DOI":"10.1007\/978-1-4614-1927-3_15"},{"issue":"1","key":"20_CR26","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T. Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optimization\u00a04(1), 4\u201320 (2007)","journal-title":"Discrete Optimization"},{"key":"20_CR27","unstructured":"IBM: CPLEX Optimizer, http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"issue":"1","key":"20_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A. W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Prog.\u00a0106(1), 25\u201357 (2006)","journal-title":"Math. Prog."},{"key":"20_CR29","unstructured":"GAMS: MINLP Library, http:\/\/www.gamsworld.org\/minlp\/minlplib.html"},{"issue":"3","key":"20_CR30","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/S0377-2217(97)00066-0","volume":"105","author":"I. Harjunkoski","year":"1998","unstructured":"Harjunkoski, I., Westerlund, T., P\u00f6rn, R., Skrifvars, H.: Different transformations for solving non-convex trim-loss problems by MINLP. Eur. J. Oper. Res.\u00a0105(3), 594\u2013603 (1998)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,26]],"date-time":"2020-07-26T09:08:46Z","timestamp":1595754526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}