1(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[2855],{13026:(e,n,i)=>{(window.__NEXT_P=window.__NEXT_P||[]).push(["/challenge/2023/call_for_problems",function(){return i(32346)}])},32346:(e,n,i)=>{"use strict";i.r(n),i.d(n,{default:()=>u});var s=i(37876),r=i(91668),l=i(63141),t=i(99638),o=i(85931),a=i(48378),c=i(77328),h=i.n(c);let d=function({children:e}){return(0,s.jsxs)(s.Fragment,{children:[(0,s.jsx)(h(),{children:(0,s.jsx)("title",{children:"MiniZinc - Challenge 2023 Call for Problems"})}),(0,s.jsx)(o.Y,{}),(0,s.jsx)("main",{children:(0,s.jsx)(l.m,{children:(0,s.jsx)("article",{className:"prose prose-minizinc max-w-none py-6",children:e})})}),(0,s.jsx)(t.w,{})]})};function m(e){let n={a:"a",br:"br",code:"code",del:"del",h2:"h2",h3:"h3",li:"li",p:"p",strong:"strong",ul:"ul",...(0,r.R)(),...e.components};return(0,s.jsxs)(s.Fragment,{children:[(0,s.jsx)(n.h2,{id:"call-for-problem-submission-for-the-minizinc-challenge-2023",children:"Call for Problem Submission for the MiniZinc Challenge 2023"}),"\n",(0,s.jsx)(a.B,{className:"not-prose",items:[["MiniZinc Challenge","/challenge"],["Challenge 2023","/challenge/2023"],"Call for Problems"]}),"\n",(0,s.jsx)(n.p,{children:"The MiniZinc Challenge is an annual solver competition in the Constraint Programming (CP) community\nheld before the International Conference on Principles and Practice of Constraint Programming.\nThe MiniZinc Challenge 2023 is seeking interesting problem sets on which various constraint solving\ntechnologies should be compared on this year. Everyone is allowed to submit problems regardless of\nwhether they are an entrant in the challenge."}),"\n",(0,s.jsx)(n.h3,{id:"important-dates-and-deadlines",children:"Important dates and deadlines:"}),"\n",(0,s.jsxs)(n.ul,{children:["\n",(0,s.jsxs)(n.li,{children:["Problem submission open: ",(0,s.jsx)(n.strong,{children:"now"})]}),"\n",(0,s.jsxs)(n.li,{children:["Problem submission deadline: ",(0,s.jsx)(n.del,{children:"Fri, 2 June 2023"})," ",(0,s.jsx)(n.strong,{children:"Fri, 30 June 2023"})]}),"\n"]}),"\n",(0,s.jsx)(n.h3,{id:"problem-submission",children:"Problem submission"}),"\n",(0,s.jsxs)(n.ul,{children:["\n",(0,s.jsxs)(n.li,{children:["Send an email with the subject line ",(0,s.jsx)(n.code,{children:"[MZNC23] benchmark"})," to ",(0,s.jsx)(n.code,{children:"mzn-challenge"})," 'at' ",(0,s.jsx)(n.code,{children:"lists.csiro.au"})," and attach an\narchive containing your problem."]}),"\n"]}),"\n",(0,s.jsx)(n.p,{children:"There are no restrictions on the kind of problems, but ideally they should be of interesting nature\nsuch as practice-related problems and puzzles etc. Problem submissions with real-world instances are\nparticularly welcome. We may need to make some modifications to submitted models to ensure they\nare in a format suitable for the challenge."}),"\n",(0,s.jsx)(n.p,{children:'The problem submitter should provide a MiniZinc model of the problem and at least 20 instances ranging\nfrom easy-to-solve to hard-to-solve for an âordinaryâ CP system. In addition, there should be at\nleast one "toy" instance for testing purposes. It is strongly encouraged to make use of the global\nconstraint definitions provided in the MiniZinc 2.7 distribution. If you have an instance generator,\nwe are more than happy to receive it.'}),"\n",(0,s.jsxs)(n.p,{children:["The submitted problem must be placed under the\n",(0,s.jsx)(n.a,{href:"https://opensource.org/licenses/MIT",children:"MIT licence"}),", and each model and data file must begin with a\ncomment which includes the licence. If you are unable to use this licence, please let us know so\nwe can arrange an alternative."]}),"\n",(0,s.jsx)(n.p,{children:"Please follow the links below for submission instructions and\nrequirements."}),"\n",(0,s.jsxs)(n.p,{children:[(0,s.jsx)(n.a,{href:"/challenge/2023",children:"www.minizinc.org/challenge/2023"}),(0,s.jsx)(n.br,{}),"\n",(0,s.jsx)(n.a,{href:"/challenge/2023/rules",children:"www.minizinc.org/challenge/2023/rules"})]})]})}function u(e={}){return(0,s.jsx)(d,{...e,children:(0,s.jsx)(m,{...e})})}},48378:(e,n,i)=>{"use strict";i.d(n,{B:()=>t});var s=i(37876),r=i(69241),l=i(37472);function t({className:e,items:n}){return e=(0,r.A)("flex items-center my-4",e),(0,s.jsx)("ul",{className:e,children:n.map((e,n)=>(0,s.jsxs)("li",{className:"flex items-center",children:[n>0?(0,s.jsx)("span",{className:"px-1 text-gray-400",children:"\xbb"}):(0,s.jsx)(s.Fragment,{}),"string"==typeof e?(0,s.jsx)("span",{children:e}):(0,s.jsx)(l.N,{href:e[1],children:e[0]})]},n))})}},91668:(e,n,i)=>{"use strict";i.d(n,{R:()=>l});var s=i(14232);let r=s.createContext({});function l(e){let n=s.useContext(r);return s.useMemo(function(){return"function"==typeof e?e(n):{...n,...e}},[n,e])}}},e=>{e.O(0,[7725,8805,6701,4040,6958,636,6593,8792],()=>e(e.s=13026)),_N_E=e.O()}]);
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.