https://www.minizinc.org/_next/static/chunks/pages/challenge/2020/results-68e2df2b3f85c8a0.js

1(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[133],{55675:(e,i,s)=>{"use strict";s.r(i),s.d(i,{default:()=>x});var r=s(37876),t=s(63141),n=s(99638),l=s(85931),c=s(37472),h=s(48378),o=s(77328),a=s.n(o),d=s(54886),p=s(17336);function x(){return(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)(a(),{children:(0,r.jsx)("title",{children:"MiniZinc - Challenge 2020 Results"})}),(0,r.jsx)(l.Y,{}),(0,r.jsx)("main",{children:(0,r.jsx)(t.m,{children:(0,r.jsxs)("article",{className:"prose prose-minizinc max-w-none py-6",children:[(0,r.jsx)("h2",{children:"MiniZinc Challenge 2020 Results"}),(0,r.jsx)(h.B,{className:"not-prose",items:[["MiniZinc Challenge","/challenge"],["Challenge 2020","/challenge/2020"],"Results"]}),(0,r.jsxs)("p",{children:["CP 2020 presentation slides of the MiniZinc Challenge 2020 will be available here."," "]}),(0,r.jsx)("h3",{children:"Entrants"}),(0,r.jsx)("p",{children:"The entrants for this year (with their descriptions, when provided):"}),(0,r.jsxs)("ul",{children:[(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"http://choco-solver.org",children:"Choco 4"})," (",(0,r.jsx)(c.N,{href:"description_choco4.txt",children:"description"}),"). A Java FD solver."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"https://github.com/potassco/flatzingo",children:"Flatzingo"})," ","(",(0,r.jsx)(c.N,{href:"description_flatzingo.txt",children:"description"}),")."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"https://github.com/ehebrard/Mistral-2.0",children:"Mistral 2.0"})," ","(",(0,r.jsx)(c.N,{href:"description_mistral2.txt",children:"description"}),")."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"http://jacop.osolpro.com",children:"JaCoP"})," (",(0,r.jsx)(c.N,{href:"description_jacop.txt",children:"description"}),"). A Java FD solver."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"http://optimathsat.disi.unitn.it",children:"OptiMathSAT"})," ","(",(0,r.jsx)(c.N,{href:"description_optimathsat.txt",children:"description"}),")."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"https://developers.google.com/optimization/",children:"OR-Tools"})," ","(",(0,r.jsx)(c.N,{href:"description_or_tools.txt",children:"description"}),")."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"http://oscarlib.bitbucket.org/cbls.html",children:"OscaR/CBLS"})," ","(",(0,r.jsx)(c.N,{href:"description_oscar_cbls.txt",children:"description"}),"). A constraint-based local search solver written in Scala."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"http://picat-lang.org",children:"PicatSAT"})," (",(0,r.jsx)(c.N,{href:"description_picat_sat.txt",children:"description"}),")."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"https://sicstus.sics.se",children:"SICStus Prolog"})," (",(0,r.jsx)(c.N,{href:"description_sicstus_prolog.txt",children:"description"}),"). A Prolog development environment with a FD constraint programming module."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"https://github.com/CP-Unibo/sunny-cp",children:"sunny-cp"}),(0,r.jsx)("sup",{children:"—"})," (",(0,r.jsx)(c.N,{href:"description_sunny_cp.txt",children:"description"}),"). A variant of sunny-cp only using Choco, Gecode, HaifaCSP, JaCoP, iZplus, MinisatID, Mistral, Opturion CPX, OR-Tools, Picat."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"https://github.com/informarte/yuck",children:"Yuck"})," (",(0,r.jsx)(c.N,{href:"description_yuck.txt",children:"description"}),"). A local search solver written in Scala."," "]})]}),(0,r.jsx)("p",{children:"In addition, the challenge organisers entered the following FlatZinc and MiniZinc implementations:"}),(0,r.jsxs)("ul",{children:[(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"https://github.com/chuffed/chuffed",children:"Chuffed"})," (",(0,r.jsx)(c.N,{href:"description_chuffed.txt",children:"description"}),"). A C++ FD solver using lazy clause generation."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"https://bitbucket.org/gkgange/geas",children:"Geas"})," (",(0,r.jsx)(c.N,{href:"description_geas.txt",children:"description"}),"). A C++ lazy clause generation solver with an OCaml FlatZinc frontend."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"http://www.gecode.org",children:"Gecode"})," (",(0,r.jsx)(c.N,{href:"description_gecode.txt",children:"description"}),"). A C++ FD solver."," "]}),(0,r.jsxs)("li",{children:[" ","MZN/Cbc. Translates to MILP (",(0,r.jsx)(c.N,{href:"description_mzn-cbc.txt",children:"description"}),"), uses"," ",(0,r.jsx)(c.N,{href:"https://projects.coin-or.org/Cbc",children:"Cbc"})," version 2.10.4."," "]}),(0,r.jsxs)("li",{children:[" ","MZN/CPLEX. Translates to MILP (",(0,r.jsx)(c.N,{href:"description_mzn-cplex.txt",children:"description"}),"), uses"," ",(0,r.jsx)(c.N,{href:"http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/index.html",children:"IBM ILOG CPLEX Optimizer"})," ","version 12.10.0.0."," "]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(c.N,{href:"https://github.com/CP-Unibo/sunny-cp",children:"sunny-cp"})," ","(",(0,r.jsx)(c.N,{href:"description_sunny_cp.txt",children:"description"}),"). A multi-threaded CP portfolio solver using 13 different CP and MIP solvers incl. Chuffed, G12 solvers, Gecode."," "]})]}),(0,r.jsxs)("p",{children:["As per the challenge"," ",(0,r.jsx)(c.N,{href:"/challenge/2020/rules",children:"rules"}),", these entries are not eligible for prizes, but do modify the scoring results."]}),(0,r.jsx)("p",{children:"Furthermore, entries in the FD search category (Gecode, JaCoP, SICStus Prolog) were automatically included in the free search category, while entries in the free search category (Chuffed, OscaR/CBLS and promoted FD entries except Gecode) were automatically included in the parallel search category. Lastly, all entries in the parallel search category and promoted entries into that category were automatically included in the open search category."}),(0,r.jsx)("p",{children:"The Choco entry submitted by the final deadline had a bug that prevented it from competing in the free and parallel categories. We entered an updated version that was provided after the deadline and fixed those problems, but we treated it the same as the other internal entries: Choco was therefore ineligible to win prizes in the free and parallel categories, but its performance modifies the scoring results."}),(0,r.jsx)(p.n,{year:2020}),(0,r.jsx)("h3",{children:"Global constraint per model"}),(0,r.jsx)("p",{children:"The following table lists the global constraints used by each model in this year's challenge. In addition, the columns RC and SBC, respectively, indicate whether the model contains redundant or/and symmetry breaking constraints."}),(0,r.jsx)(d.R,{year:2020}),(0,r.jsx)("p",{}),(0,r.jsx)("hr",{}),(0,r.jsx)("p",{children:"The files on this page are for MiniZinc ver

1sion 2.4.3."}),(0,r.jsxs)("div",{id:"footer",children:[" ","\xa9",(0,r.jsx)(c.N,{href:"http://data61.csiro.au",children:"Data61, CSIRO"}),", 2020"," "]})]})})}),(0,r.jsx)(n.w,{})]})}},58800:(e,i,s)=>{(window.__NEXT_P=window.__NEXT_P||[]).push(["/challenge/2020/results",function(){return s(55675)}])}},e=>{e.O(0,[7725,8805,6701,4040,6958,1958,636,6593,8792],()=>e(e.s=58800)),_N_E=e.O()}]);