{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T06:19:37Z","timestamp":1772000377502,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,1,17]],"date-time":"2017-01-17T00:00:00Z","timestamp":1484611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,17]],"date-time":"2017-01-17T00:00:00Z","timestamp":1484611200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1415460"],"award-info":[{"award-number":["CCF-1415460"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-12-1-0151"],"award-info":[{"award-number":["FA9550-12-1-0151"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10107-016-1101-8","type":"journal-article","created":{"date-parts":[[2017,1,17]],"date-time":"2017-01-17T19:55:08Z","timestamp":1484682908000},"page":"369-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["An abstract model for branching and its application to mixed integer programming"],"prefix":"10.1007","volume":"166","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0842-9533","authenticated-orcid":false,"given":"Pierre","family":"Le Bodic","sequence":"first","affiliation":[]},{"given":"George","family":"Nemhauser","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,17]]},"reference":[{"key":"1101_CR1","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007)"},{"issue":"1","key":"1101_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":"1101_CR3","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, Volume 5547 of Lecture Notes in Computer Science","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T., Berthold, T.: Hybrid branching. In: Hoeve, W.J., Hooker, J.N. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Volume 5547 of Lecture Notes in Computer Science, pp. 309\u2013311. Springer, Berlin (2009)"},{"issue":"4","key":"1101_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006)","journal-title":"Oper. Res. Lett."},{"key":"1101_CR5","volume-title":"Mixed Integer Programming: Analyzing 12 Years of Progress","author":"T Achterberg","year":"2013","unstructured":"Achterberg, T., Wunderling, R.: Mixed Integer Programming: Analyzing 12 Years of Progress. Springer, Berlin (2013)"},{"key":"1101_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming, Volume 271 of Graduate Texts in Mathematics","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming, Volume 271 of Graduate Texts in Mathematics. Springer, Berlin (2014)"},{"key":"1101_CR7","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"1101_CR8","volume-title":"Basic Algebra I: Second Edition","author":"N Jacobson","year":"2009","unstructured":"Jacobson, N.: Basic Algebra I: Second Edition. Dover, Mineola (2009)"},{"issue":"2","key":"1101_CR9","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. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"1101_CR10","first-page":"205","volume-title":"Handbook of Satisfiability, Volume 185 of Frontiers in Artificial Intelligence and Applications","author":"O Kullmann","year":"2009","unstructured":"Kullmann, O.: Fundaments of branching heuristics. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, Volume 185 of Frontiers in Artificial Intelligence and Applications, pp. 205\u2013244. IOS Press, Amsterdam (2009)"},{"issue":"3","key":"1101_CR11","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"},{"key":"1101_CR12","first-page":"1","volume":"2","author":"A Lodi","year":"2013","unstructured":"Lodi, A., Tramontani, A.: Performance variability in mixed-integer programming. Tuter. Oper. Res. Theory Driven Infl. Appl. 2, 1\u201312 (2013)","journal-title":"Tuter. Oper. Res. Theory Driven Infl. Appl."},{"key":"1101_CR13","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"1101_CR14","volume-title":"Numerical Recipes 3rd Edition: The Art of Scientific Computing","author":"WH Press","year":"2007","unstructured":"Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes 3rd Edition: The Art of Scientific Computing, 3rd edn. Cambridge University Press, New York (2007)","edition":"3"},{"issue":"1","key":"1101_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"LJ Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 1\u201322 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"1101_CR16","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20(5), 865\u2013877 (1991)","journal-title":"SIAM J. Comput."}],"updated-by":[{"DOI":"10.1007\/s10107-017-1118-7","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T00:00:00Z","timestamp":1486425600000}}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1101-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1101-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1101-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T15:20:49Z","timestamp":1749914449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1101-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,17]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1101"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1101-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,17]]},"assertion":[{"value":"5 November 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2017","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Erratum","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"An erratum to this article has been published.","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}