{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:43Z","timestamp":1740109303239,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T00:00:00Z","timestamp":1598486400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T00:00:00Z","timestamp":1598486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Faculty of Information Technology, Monash University","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10107-020-01556-4","type":"journal-article","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T11:02:32Z","timestamp":1598526152000},"page":"811-841","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Further results on an abstract model for branching and its application to mixed integer programming"],"prefix":"10.1007","volume":"190","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5853-0472","authenticated-orcid":false,"given":"Daniel","family":"Anderson","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Le Bodic","sequence":"additional","affiliation":[]},{"given":"Kerri","family":"Morgan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"1556_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007)"},{"issue":"1","key":"1556_CR2","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. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"1556_CR3","doi-asserted-by":"crossref","unstructured":"Achterberg, T., Berthold, T.: Hybrid branching. In: International Conference on AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR) (2009)","DOI":"10.1007\/978-3-642-01929-6_23"},{"key":"1556_CR4","doi-asserted-by":"publisher","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42\u201354 (2005). https:\/\/doi.org\/10.1016\/j.orl.2004.04.002","DOI":"10.1016\/j.orl.2004.04.002"},{"key":"1556_CR5","doi-asserted-by":"crossref","unstructured":"Acton, F.S.: Numerical methods that work. Mathematical Association of America (1990)","DOI":"10.1090\/spec\/002"},{"issue":"1","key":"1556_CR6","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/ijoc.2016.0723","volume":"29","author":"AM Alvarez","year":"2017","unstructured":"Alvarez, A.M., Louveaux, Q., Wehenkel, L.: A machine learning-based approximation of strong branching. INFORMS J. Comput. 29(1), 185\u2013195 (2017)","journal-title":"INFORMS J. Comput."},{"key":"1556_CR7","doi-asserted-by":"crossref","unstructured":"Anderson, D., Hendel, G., Le\u00a0Bodic, P., Viernickel, M.: Clairvoyant restarts in branch-and-bound search using online tree-size estimation. In: AAAI Conference on Artificial Intelligence (2019)","DOI":"10.1609\/aaai.v33i01.33011427"},{"key":"1556_CR8","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, B.: Finding cuts in the tsp (a preliminary report). Tech. rep., Center for Discrete Mathematics & Theoretical Computer Science (1995)"},{"key":"1556_CR9","unstructured":"Balcan, M.F., Dick, T., Sandholm, T., Vitercik, E.: Learning to branch. In: International Conference on Machine Learning (ICML) (2018)"},{"issue":"1","key":"1556_CR10","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 linear programming. Math. Program. 1(1), 76\u201394 (1971)","journal-title":"Math. Program."},{"key":"1556_CR11","unstructured":"Gamrath, G., Anderson, D., Bestuzheva, K., Chen, W.K., Eifler, L., Gasse, M., Gemander, P., Gleixner, A., Gottwald, L., Halbig, K., Hendel, G., Hojny, C., Koch, T., Le\u00a0Bodic, P., Maher, S.J., Matter, F., Miltenberger, M., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Tawfik, C., Vigerske, S., Wegscheider, F., Weninger, D., Witzig, J.: The scip optimization suite 7.0. Tech. Rep. 20-10, ZIB, Takustr. 7, 14195 Berlin (2020)"},{"key":"1556_CR12","volume-title":"Computers and Intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman & Co., New York (2002)"},{"key":"1556_CR13","unstructured":"Gleixner, A., Bastubbe, M., Eifler, L., Gally, T., Gamrath, G., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., L\u00fcbbecke, M.E., Maher, S.J., Miltenberger, M., M\u00fcller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schl\u00f6sser, F., Schubert, C., Serrano, F., Shinano, Y., Viernickel, J.M., Walter, M., Wegscheider, F., Witt, J.T., Witzig, J.: The SCIP Optimization Suite 6.0. Technical report, Optimization Online (2018)"},{"issue":"2","key":"1556_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.ipl.2015.09.015","volume":"116","author":"C Haase","year":"2016","unstructured":"Haase, C., Kiefer, S.: The complexity of the Kth largest subset problem and related problems. Inf. Process. Lett. 116(2), 111\u2013115 (2016)","journal-title":"Inf. Process. Lett."},{"key":"1556_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0682-2","volume-title":"Computability and Complexity Theory","author":"S Homer","year":"2011","unstructured":"Homer, S., Selman, A.L.: Computability and Complexity Theory. Springer, New York (2011)"},{"key":"1556_CR16","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Le\u00a0Bodic, P., Song, L., Nemhauser, G.L., Dilkina, B.N.: Learning to branch in mixed integer programming. In: AAAI Conference on Artificial Intelligence (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"1556_CR17","first-page":"205","volume":"185","author":"O Kullmann","year":"2009","unstructured":"Kullmann, O.: Fundaments of branching heuristics. Handbook Satisfiab. 185, 205\u2013244 (2009)","journal-title":"Handbook Satisfiab."},{"key":"1556_CR18","doi-asserted-by":"crossref","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica: J. Econ Soc. pp. 497\u2013520 (1960)","DOI":"10.2307\/1910129"},{"issue":"1\u20132","key":"1556_CR19","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-016-1101-8","volume":"166","author":"P Le Bodic","year":"2017","unstructured":"Le Bodic, P., Nemhauser, G.: An abstract model for branching and its application to mixed integer programming. Math. Program. 166(1\u20132), 369\u2013405 (2017)","journal-title":"Math. Program."},{"issue":"1","key":"1556_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.7146\/math.scand.a-10593","volume":"8","author":"W Ljunggren","year":"1960","unstructured":"Ljunggren, W.: On the irreducibility of certain trinomials and quadrinomials. Math. Scand. 8(1), 65\u201370 (1960)","journal-title":"Math. Scand."},{"key":"1556_CR21","doi-asserted-by":"publisher","unstructured":"Lodi, A., Tramontani, A.: Performance Variability in Mixed-Integer Programming, chap. Chapter 1, pp. 1\u201312. INFORMS (2013). https:\/\/doi.org\/10.1287\/educ.2013.0112","DOI":"10.1287\/educ.2013.0112"},{"key":"1556_CR22","unstructured":"MIPLIB 2017 (2018). http:\/\/miplib.zib.de"},{"issue":"2","key":"1556_CR23","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/0022-314X(87)90029-1","volume":"25","author":"H Osada","year":"1987","unstructured":"Osada, H.: The Galois groups of the polynomials $${{X}^n + a{X}^l + b}$$. J. Number Theory 25(2), 230\u2013238 (1987)","journal-title":"J. Number Theory"},{"issue":"3","key":"1556_CR24","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/PL00011407","volume":"89","author":"JH Owen","year":"2001","unstructured":"Owen, J.H., Mehrotra, S.: A disjunctive cutting plane procedure for general mixed-integer linear programs. Math. Program. 89(3), 437\u2013448 (2001)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01556-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01556-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01556-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T10:18:44Z","timestamp":1668075524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01556-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,27]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1556"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01556-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2020,8,27]]},"assertion":[{"value":"3 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}