{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:35:32Z","timestamp":1772120132237,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN Oper. Res. Forum"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s43069-020-00023-2","type":"journal-article","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T04:57:31Z","timestamp":1599713851000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Nutmeg: a MIP and CP Hybrid Solver Using Branch-and-Check"],"prefix":"10.1007","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4485-5014","authenticated-orcid":false,"given":"Edward","family":"Lam","sequence":"first","affiliation":[]},{"given":"Graeme","family":"Gange","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[]},{"given":"Jip J.","family":"Dekker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,8]]},"reference":[{"issue":"1","key":"23_CR1","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 (2007) Conflict analysis in mixed integer programming. Discrete Optim 4(1):4\u201320","journal-title":"Discrete Optim"},{"issue":"1","key":"23_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 (2009) SCIP: solving constraint integer programs. Math Program Comput 1(1):1\u201341","journal-title":"Math Program Comput"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.cor.2007.10.017","volume":"36","author":"M Albareda-Sambola","year":"2009","unstructured":"Albareda-Sambola M, Fern\u00e1ndez E, Laporte G (2009) The capacity and distance constrained plant location problem. Comput Oper Res 36:597\u2013611","journal-title":"Comput Oper Res"},{"key":"#cr-split#-23_CR4.1","doi-asserted-by":"crossref","unstructured":"Beck JC (2010) Checking-up on branch-and-check. In: Cohen D","DOI":"10.1007\/978-3-642-15396-9_10"},{"key":"#cr-split#-23_CR4.2","unstructured":"(ed) Principles and practice of constraint programming - CP 2010, lecture notes in computer science, vol 6308. Springer, Berlin, pp 84-98"},{"key":"#cr-split#-23_CR5.1","doi-asserted-by":"crossref","unstructured":"Belov G, Stuckey PJ, Tack G, Wallace M (2016) Improved linearization of constraint programming models. In: Rueher M","DOI":"10.1007\/978-3-319-44953-1_4"},{"key":"#cr-split#-23_CR5.2","unstructured":"(ed) Principles and practice of constraint programming: 22nd international conference, CP 2016, Toulouse, France, September 5-9, 2016. proceedings. Springer International Publishing, pp 49-65"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10601-012-9119-x","volume":"17","author":"P Benchimol","year":"2012","unstructured":"Benchimol P, van Hoeve WJ, R\u00e9gin JC, Rousseau LM, Rueher M (2012) Improved filtering for weighted circuit constraints. Constraints 17(3):205\u2013233","journal-title":"Constraints"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische mathematik 4(1):238\u2013252","journal-title":"Numerische mathematik"},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1026488509554","volume":"4","author":"E Bensana","year":"1999","unstructured":"Bensana E, Lemaitre M, Verfaillie G (1999) Earth observation satellite management. Constraints 4(3):293\u2013299","journal-title":"Constraints"},{"key":"23_CR9","unstructured":"Chu GG Improving combinatorial optimization. Ph.D. thesis, University of Melbourne (2011). http:\/\/hdl.handle.net\/11343\/36679"},{"key":"23_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer programming, vol 271","author":"M Conforti","year":"2014","unstructured":"Conforti M, Cornu\u00e9jols G, Zambelli G (2014) Integer programming, vol 271. Springer, Berlin"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Davies TO, Gange G, Stuckey PJ (2017) Automatic logic-based Benders decomposition with MiniZinc. In: AAAI, pp 787\u2013793","DOI":"10.1609\/aaai.v31i1.10654"},{"key":"#cr-split#-23_CR12.1","doi-asserted-by":"crossref","unstructured":"Feydy T, Stuckey PJ (2009) Lazy clause generation reengineered. In: Gent IP","DOI":"10.1007\/978-3-642-04244-7_29"},{"key":"#cr-split#-23_CR12.2","unstructured":"(ed) Principles and practice of constraint programming - CP 2009: 15th international conference, CP 2009 lisbon, portugal, september 20-24, 2009 proceedings. Springer, Berlin, pp 352-366"},{"issue":"3-4","key":"23_CR13","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1020589922418","volume":"7","author":"F Focacci","year":"2002","unstructured":"Focacci F, Lodi A, Milano M (2002) Optimization-oriented global constraints. Constraints 7(3-4):351\u2013365","journal-title":"Constraints"},{"key":"#cr-split#-23_CR14.1","doi-asserted-by":"crossref","unstructured":"Fontaine D, Michel L, Van Hentenryck P (2014) Constraint-based Lagrangian relaxation. In: O'sullivan B","DOI":"10.1007\/978-3-319-10428-7_25"},{"key":"#cr-split#-23_CR14.2","unstructured":"(ed) Principles and practice of constraint programming: 20th international conference, CP 2014, Lyon, France, September 8-12, 2014. proceedings. lecture notes in computer science, vol 8656. Springer International Publishing, pp 324-339"},{"key":"23_CR15","volume-title":"Generic branch-cut-and-price","author":"G Gamrath","year":"2010","unstructured":"Gamrath G (2010) Generic branch-cut-and-price. Ph.D. thesis, Technische Universit\u00e4t Berlin"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Gamrath G, L\u00fcbbecke ME (2010) Experiments with a generic Dantzig-Wolfe decomposition for integer programs. In: Festa P, Experimental algorithms: 9th international symposium SEA 2010 Ischia Island (eds). Springer, Berlin, pp 239\u2013252","DOI":"10.1007\/978-3-642-13193-6_21"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Gange G, Berg J, Demirovi\u0107 E, Stuckey PJ (2020) Core-guided and core-boosted search for CP. In: Proceedings of the 7th international conference on the integration of constraint programming, artificial intelligence, and operations research. (to appear)","DOI":"10.1007\/978-3-030-58942-4_14"},{"key":"23_CR18","unstructured":"Gleixner A, Bastubbe M, Eifler L, Gally T, Gamrath G, Gottwald RL, Hendel G, Hojny C, Koch T, L\u00fcbbecke ME, Maher SJ, Miltenberger M, M\u00fcller B, Pfetsch ME, Puchert C, Rehfeldt D, Schl\u00f6sser F, Schubert C, Serrano F, Shinano Y, Viernickel JM, Walter M, Wegscheider F, Witt JT, Witzig J (2018) The SCIP Optimization Suite 6.0. ZIB-Report 18-26, Zuse Institute Berlin. http:\/\/nbn-resolving.de\/urn:nbn:de:0297-zib-69361"},{"key":"#cr-split#-23_CR19.1","doi-asserted-by":"crossref","unstructured":"Hooker JN (2004) A hybrid method for planning and scheduling. In: Wallace M","DOI":"10.1007\/978-3-540-30201-8_24"},{"key":"#cr-split#-23_CR19.2","unstructured":"(ed) Principles and practice of constraint programming - CP 2004, lecture notes in computer science, vol 3258. Springer, Berlin, pp 305-316"},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"JN Hooker","year":"2007","unstructured":"Hooker JN (2007) Planning and scheduling by logic-based Benders decomposition. Oper Res 55(3):588\u2013602","journal-title":"Oper Res"},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math Program 96(1):33\u201360","journal-title":"Math Program"},{"key":"#cr-split#-23_CR22.1","doi-asserted-by":"crossref","unstructured":"Junker U, Karisch SE, Kohl N, Vaaben B, Fahle T, Sellmann M (1999) A framework for constraint programming based column generation. In: Jaffar J","DOI":"10.1007\/978-3-540-48085-3_19"},{"key":"#cr-split#-23_CR22.2","unstructured":"(ed) Principles and practice of constraint programming - CP'99: 5th international conference, CP'99, alexandria, VA, USA, October 11-14, 1999. Proceedings. Springer, pp 261-274"},{"key":"23_CR23","unstructured":"Lam E (2017) Hybrid optimization of vehicle routing problems. Ph.D. thesis, University of Melbourne. http:\/\/hdl.handle.net\/11343\/220534"},{"issue":"3","key":"23_CR24","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/s10601-016-9241-2","volume":"21","author":"E Lam","year":"2016","unstructured":"Lam E, Van Hentenryck P (2016) A branch-and-price-and-check model for the vehicle routing problem with location congestion. Constraints 21 (3):394\u2013412","journal-title":"Constraints"},{"key":"#cr-split#-23_CR25.1","doi-asserted-by":"crossref","unstructured":"Lam E, Van Hentenryck P (2017) Branch-and-check with explanations for the vehicle routing problem with time windows. In: Beck JC","DOI":"10.1007\/978-3-319-66158-2_37"},{"key":"#cr-split#-23_CR25.2","unstructured":"(ed) Principles and practice of constraint programming: 23rd international conference, CP 2017, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings. Springer, Cham, pp 579-595"},{"key":"23_CR26","unstructured":"Marques Silva JaP, Sakallah KA (1996) GRASP\u2013a new search algorithm for satisfiability. In: Proceedings of the 1996 IEEE\/ACM international conference on computer-aided design, ICCAD \u201996. IEEE Computer Society, pp 220\u2013227"},{"key":"#cr-split#-23_CR27.1","unstructured":"Nethercote N, Stuckey PJ, Becket R, Brand S, Duck GJ, Tack G (2007) Minizinc: towards a standard CP modelling language. In: Bessi\u00e8re C"},{"key":"#cr-split#-23_CR27.2","unstructured":"(ed) Principles and practice of constraint programming - CP 2007. Springer, Berlin, pp 529-543"},{"issue":"3","key":"23_CR28","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O Ohrimenko","year":"2009","unstructured":"Ohrimenko O, Stuckey PJ, Codish M (2009) Propagation via lazy clause generation. Constraints 14(3):357\u2013391","journal-title":"Constraints"},{"key":"#cr-split#-23_CR29.1","doi-asserted-by":"crossref","unstructured":"Refalo P (2000) Linear formulation of constraint programming models and hybrid solvers. In: Dechter R","DOI":"10.1007\/3-540-45349-0_27"},{"key":"#cr-split#-23_CR29.2","unstructured":"(ed) Principles and practice of constraint programming - CP 2000. Springer, Berlin, pp 369-383"},{"issue":"3","key":"23_CR30","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1020506526052","volume":"7","author":"JC R\u00e9gin","year":"2002","unstructured":"R\u00e9gin JC (2002) Cost-based arc consistency for global cardinality constraints. Constraints 7(3):387\u2013405","journal-title":"Constraints"},{"issue":"3","key":"23_CR31","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/s10601-010-9103-2","volume":"16","author":"A Schutt","year":"2010","unstructured":"Schutt A, Feydy T, Stuckey PJ, Wallace MG (2010) Explaining the cumulative propagator. Constraints 16(3):250\u2013282","journal-title":"Constraints"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Shen K, Schimpf J (2005) Eplex: Harnessing mathematical programming solvers for constraint logic programming. In: Principles and practice of constraint programming: 11th international conference, CP2005, proceedings, LNCS, vol 3709. Springer, pp 622\u2013636","DOI":"10.1007\/11564751_46"},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"Steiger R, van Hoeve WJ, Szymanek R (2011) An efficient generic network flow constraint. In: Proceedings of the 2011 ACM symposium on applied computing. ACM, pp 893\u2013900","DOI":"10.1145\/1982185.1982381"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Ta\u015fkin ZC (2010) Benders decomposition. In: Wiley encyclopedia of operations research and management science. Wiley","DOI":"10.1002\/9780470400531.eorms0104"},{"key":"23_CR35","doi-asserted-by":"crossref","unstructured":"Thorsteinsson E (2001) Branch-and-check: a hybrid framework integrating mixed integer programming and constraint logic programming. In: Walsh T (ed) Principles and practice of constraint programming \u2013 CP. lecture notes in computer science, vol 2239. Springer, Berlin, pp 16\u201330","DOI":"10.1007\/3-540-45578-7_2"}],"container-title":["SN Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00023-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-020-00023-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00023-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T23:59:11Z","timestamp":1696636751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-020-00023-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["23"],"URL":"https:\/\/doi.org\/10.1007\/s43069-020-00023-2","relation":{"is-basis-for":[{"id-type":"doi","id":"10.52843\/cassyni.zxy00z","asserted-by":"object"}]},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9]]},"assertion":[{"value":"23 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interest"}}],"article-number":"22"}}