https://www.minizinc.org/_next/static/chunks/pages/challenge/2022/results-844521ecc8cc7068.js

1(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[659],{34413:(e,i,s)=>{"use strict";s.r(i),s.d(i,{default:()=>x});var r=s(37876),n=s(63141),t=s(99638),c=s(85931),l=s(48378),h=s(54886),o=s(37472),d=s(17336),a=s(77328),p=s.n(a);function x(){return(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)(p(),{children:(0,r.jsx)("title",{children:"MiniZinc - Challenge 2022 Results"})}),(0,r.jsx)(c.Y,{}),(0,r.jsx)("main",{children:(0,r.jsx)(n.m,{children:(0,r.jsxs)("article",{className:"prose prose-minizinc max-w-none py-6",children:[(0,r.jsx)("h2",{children:"MiniZinc Challenge 2022 Results"}),(0,r.jsx)(l.B,{className:"not-prose",items:[["MiniZinc Challenge","/challenge"],["Challenge 2022","/challenge/2022"],"Results"]}),(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)(o.N,{href:"http://choco-solver.org",children:"Choco 4"})," (",(0,r.jsx)(o.N,{href:"description_choco-solver.txt",children:"description"}),"). A Java FD solver."]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(o.N,{href:"https://github.com/potassco/flatzingo",children:"flatzingo"})," ","(",(0,r.jsx)(o.N,{href:"description_flatzingo_1_9.txt",children:"description"}),")."]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(o.N,{href:"https://bitbucket.org/gkgange/geas",children:"Geas"})," (",(0,r.jsx)(o.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)(o.N,{href:"http://www.constraint.org/en/izc_download/",children:"iZplus"})," ","(",(0,r.jsx)(o.N,{href:"description_izplus.txt",children:"description"}),")."]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(o.N,{href:"https://github.com/radsz/jacop",children:"JaCoP"})," (",(0,r.jsx)(o.N,{href:"description_jacop.txt",children:"description"}),"). A Java FD solver."]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(o.N,{href:"https://github.com/ehebrard/Mistral-2.0",children:"Mistral-2.0"})," ","(",(0,r.jsx)(o.N,{href:"description_mistral-2_0.txt",children:"description"}),")."]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(o.N,{href:"https://developers.google.com/optimization/",children:"OR-Tools"})," ","(",(0,r.jsx)(o.N,{href:"description_or-tools_cp-sat.txt",children:"description"}),")."]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(o.N,{href:"http://picat-lang.org",children:"PicatSAT"})," (",(0,r.jsx)(o.N,{href:"description_picatsat.txt",children:"description"}),")."]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(o.N,{href:"https://sicstus.sics.se",children:"SICStus Prolog"})," (",(0,r.jsx)(o.N,{href:"description_sicstus.txt",children:"description"}),"). A Prolog development environment with a FD constraint programming module."]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(o.N,{href:"https://github.com/informarte/yuck",children:"Yuck"})," (",(0,r.jsx)(o.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)(o.N,{href:"https://github.com/chuffed/chuffed",children:"Chuffed"})," (",(0,r.jsx)(o.N,{href:"description_chuffed.txt",children:"description"}),"). A C++ FD solver using lazy clause generation."]}),(0,r.jsxs)("li",{children:[(0,r.jsx)(o.N,{href:"https://www.gecode.org",children:"Gecode"})," (",(0,r.jsx)(o.N,{href:"description_gecode.txt",children:"description"}),"). A C++ FD solver."]}),(0,r.jsxs)("li",{children:["CpoFzn (",(0,r.jsx)(o.N,{href:"description_cpofzn.txt",children:"description"}),"). Uses"," ",(0,r.jsx)(o.N,{href:"https://github.com/IBMDecisionOptimization/cpofzn",children:"IBM ILOG CP Optimizer"})," ","version 20.10."]}),(0,r.jsxs)("li",{children:["MZN/Cbc (",(0,r.jsx)(o.N,{href:"description_mzn-cbc.txt",children:"description"}),"). Translates to MILP, uses"," ",(0,r.jsx)(o.N,{href:"https://projects.coin-or.org/Cbc",children:"Cbc"})," version 2.10.8."]}),(0,r.jsxs)("li",{children:["MZN/CPLEX (",(0,r.jsx)(o.N,{href:"description_mzn-cplex.txt",children:"description"}),"). Translates to MILP, uses"," ",(0,r.jsx)(o.N,{href:"https://www.ibm.com/analytics/cplex-optimizer",children:"IBM ILOG CPLEX Optimizer"})," ","version 20.10."]}),(0,r.jsxs)("li",{children:["MZN/Gurobi (",(0,r.jsx)(o.N,{href:"description_mzn-gurobi.txt",children:"description"}),"). Translates to MILP, uses"," ",(0,r.jsx)(o.N,{href:"https://www.gurobi.com/",children:"Gurobi"})," version 9.1.2."]}),(0,r.jsxs)("li",{children:["MZN/HiGHS (",(0,r.jsx)(o.N,{href:"description_mzn-highs.txt",children:"description"}),"). Translates to MILP, uses"," ",(0,r.jsx)(o.N,{href:"https://highs.dev/",children:"HiGHS"})," version 1.2.2."]}),(0,r.jsxs)("li",{children:["MZN/SCIP (",(0,r.jsx)(o.N,{href:"description_mzn-scip.txt",children:"description"}),"). Translates to MILP, uses"," ",(0,r.jsx)(o.N,{href:"https://www.sci

1popt.org/",children:"SCIP"})," version 8.0.0."]})]}),(0,r.jsxs)("p",{children:["As per the challenge"," ",(0,r.jsx)(o.N,{href:"/challenge/2022/rules",children:"rules"}),", these entries are not eligible for prizes, but do modify the scoring results."]}),(0,r.jsx)(d.n,{year:2022}),(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)(h.R,{year:2022}),(0,r.jsx)("hr",{}),(0,r.jsx)("p",{children:"The files on this page are for MiniZinc version 2.6.3."})]})})}),(0,r.jsx)(t.w,{})]})}},36224:(e,i,s)=>{(window.__NEXT_P=window.__NEXT_P||[]).push(["/challenge/2022/results",function(){return s(34413)}])}},e=>{e.O(0,[7725,8805,6701,4040,6958,1958,636,6593,8792],()=>e(e.s=36224)),_N_E=e.O()}]);