PageSourceSearch

https://www.minizinc.org/_next/static/chunks/pages/challenge/2024/call_for_problems-5f3094af736e7275.js

js minizinc.org collected 2026-09-24 09:28:43 UTC 10,467 bytes, 1 lines download raw bytes

1(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[7792],{39364:(e,n,s)=>{"use strict";s.d(n,{M:()=>t,p:()=>l});var r=s(37876),i=s(37472);let l={2026:(()=>{let e="Fri, 8 May 2026";return{announcements:[(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2026-07-23"})," Announcements of the results are"," ",(0,r.jsx)(i.N,{href:"/challenge/2026/results",children:"here"}),"."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2026-06-09"})," A typo in the rules regarding the command used for running solvers was corrected."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2026-04-23"})," Problem submission deadline extended."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2026-01-19"})," Official"," ",(0,r.jsx)(i.N,{href:"/challenge/2026/call_for_problems",children:"Call for Problems"})," ","for the MiniZinc Challenge."]})],problemSubmissionDeadline:e,minizinc:"2.9.7",dates:[(0,r.jsxs)(r.Fragment,{children:["Registration opens: ",(0,r.jsx)("strong",{children:"Now"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Problem submission deadline: ",(0,r.jsx)("s",{children:"Fri, 24 April 2026"})," ",(0,r.jsx)("strong",{children:e}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Solver submission begins: ",(0,r.jsx)("strong",{children:"Mon, 4 May 2026"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Solver submission deadline: ",(0,r.jsx)("strong",{children:"Fri, 19 June 2026"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Announcement of results at"," ",(0,r.jsx)(i.N,{href:"https://cp2026.a4cp.org/",children:"CP2026"}),":"," ",(0,r.jsx)("strong",{children:"20 - 23 July 2026"})," (Lisbon, Portugal)."]})]}})(),2025:(()=>{let e="Fri, 6 June 2025";return{announcements:[(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2026-01-14"})," Amendment made to the results to fix an issue with undetected incorrect optimality claims. Thanks to Alessio Pellegrino for reporting."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2025-09-15"})," Announcements of the results are"," ",(0,r.jsx)(i.N,{href:"/challenge/2025/results",children:"here"}),"."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2025-05-16"})," The tie-breaking procedure for incomplete scoring has been updated in the"," ",(0,r.jsx)(i.N,{href:"/challenge/2025/rules#incomplete-scoring-procedure",children:"rules"}),"."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2025-05-16"})," Problem submission deadline extended."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2025-02-11"})," Official"," ",(0,r.jsx)(i.N,{href:"/challenge/2025/call_for_problems",children:"Call for Problems"})," ","for the MiniZinc Challenge."]})],problemSubmissionDeadline:e,minizinc:"2.9.3",dates:[(0,r.jsxs)(r.Fragment,{children:["Registration opens: ",(0,r.jsx)("strong",{children:"Now"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Problem submission deadline: ",(0,r.jsx)("s",{children:"Fri, 16 May 2025"})," ",(0,r.jsx)("strong",{children:e}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Solver submission begins: ",(0,r.jsx)("strong",{children:"Mon, 26 May 2025"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Solver submission deadline: ",(0,r.jsx)("strong",{children:"Fri, 11 July 2025"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Announcement of results at"," ",(0,r.jsx)(i.N,{href:"https://cp2025.a4cp.org/",children:"CP2025"}),":"," ",(0,r.jsx)("strong",{children:"10 - 15 August 2025"})," (Glasgow, Scotland)."]})]}})(),2024:(()=>{let e="Fri, 28 June 2024";return{announcements:[(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2026-01-14"})," Amendment made to the results to fix an issue with undetected incorrect optimality claims. Thanks to Alessio Pellegrino for reporting."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2024-09-05"})," Announcements of the results are"," ",(0,r.jsx)(i.N,{href:"/challenge/2024/results",children:"here"}),"."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2024-07-15"})," Update the"," ",(0,r.jsx)(i.N,{href:"/challenge/2024/docker",children:"Docker image preparation instructions"})," ","to fix some minor errors."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2024-06-03"})," Problem submission deadline extended."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2024-02-12"})," Official"," ",(0,r.jsx)(i.N,{href:"/challenge/2024/call_for_problems",children:"Call for Problems"})," ","for the MiniZinc Challenge."]})],problemSubmissionDeadline:e,minizinc:"2.8.5",dates:[(0,r.jsxs)(r.Fragment,{children:["Registration opens: ",(0,r.jsx)("strong",{children:"Now"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Problem submission deadline: ",(0,r.jsx)("s",{children:"Fri, 7 June 2024"})," ",(0,r.jsx)("strong",{children:e}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Solver submission begins: ",(0,r.jsx)("strong",{children:"Mon, 17 June 2024"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Solver submission deadline: ",(0,r.jsx)("strong",{children:"Fri, 2 August 2024"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Announcement of results at"," ",(0,r.jsx)(i.N,{href:"https://cp2024.a4cp.org/",children:"CP2024"}),":"," ",(0,r.jsx)("strong",{children:"2 - 6 September 2024"})," (Girona, Catalonia)."]})]}})()};function t(e){let n=e-2008+1,s=n%100;if(s>3&&s<21)return(0,r.jsxs)(r.Fragment,{children:[n,(0,r.jsx)("sup",{children:"th"})]});switch(s%10){case 1:return(0,r.jsxs)(r.Fragment,{children:[n,(0,r.jsx)("sup",{children:"st"})]});case 2:return(0,r.jsxs)(r.Fragment,{children:[n,(0,r.jsx)("sup",{children:"nd"})]});case 3:return(0,r.jsxs)(r.Fragment,{children:[n,(0,r.jsx)("sup",{children:"rd"})]})}return(0,r.jsxs)(r.Fragment,{children:[n,(0,r.jsx)("sup",{children:"th"})]})}},48378:(e,n,s)=>{"use strict";s.d(n,{B:()=>t});var r=s(37876),i=s(69241),l=s(37472);function t({className:e,items:n}){return e=(0,i.A)("flex items-center my-4",e),(0,r.jsx)("ul",{className:e,children:n.map((e,n)=>(0,r.jsxs)("li",{className:"flex items-center",children:[n>0?(0,r.jsx)("span",{className:"px-1 text-gray-400",children:"\xbb"}):(0,r.jsx)(r.Fragment,{}),"string"==typeof e?(0,r.jsx)("span",{children:e}):(0,r.jsx)(l.N,{href:e[1],children:e[0]})]},n))})}},62265:(e,n,s)=>{"use strict";s.r(n),s.d(n,{challenge:()=>u,default:()=>p,year:()=>g});var r=s(37876),i=s(91668),l=s(39364),t=s(63141),o=s(99638),c=s(37472),a=s(85931),h=s(48378),d=s(77328),m=s.n(d);let g=2024,u=l.p[g],x=function({children:e}){return(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)(m(),{children:(0,r.jsx)("title",{children:`MiniZinc - Challenge ${g} Call for Problems`})}),(0,r.jsx)(a.Y,{}),(0,r.jsx)("main",{children:(0,r.jsx)(t.m,{children:(0,r.jsx)("article",{className:"prose prose-minizinc max-w-none py-6",children:e})})}),(0,r.jsx)(o.w,{})]})};function j(e){let n={a:"a",code:"code",h2:"h2",h3:"h3",li:"li",p:"p",strong:"strong",ul:"ul",...(0,i.R)(),...e.components};return(0,r.jsxs)(r.Fragment,{children:[(0,r.jsxs)(n.h2,{id:"call-for-problem-submission-for-the-minizinc-challenge-",children:["Call for Problem Submission for the MiniZinc Challenge ",g]}),"\n",(0,r.jsx)(h.B,{className:"not-prose",items:[["MiniZinc Challenge","/challenge"],[`Challenge ${g}`,`/challenge/${g}`],"Call for problems"]}),"\n",(0,r.jsxs)(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 ",g," 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,r.jsx)(n.h3,{id:"important-dates-and-deadlines",children:"Important dates and deadlines:"}),"\n",(0,r.jsxs)(n.ul,{children:["\n",(0,r.jsxs)(n.li,{children:["Problem submission open: ",(0,r.jsx)(n.strong,{children:"now"})]}),"\n",(0,r.jsxs)(n.li,{children:["Problem submission deadline: ",(0,r.jsx)(n.strong,{children:u.problemSubmissionDeadline})]}),"\n"]}),"\n",(0,r.jsx)(n.h3,{id:"problem-submission",children:"Problem submission"}),"\n",(0,r.jsxs)(n.ul,{children:["\n",(0,r.jsxs)(n.li,{children:["Send an email to ",(0,r.jsx)(n.code,{children:"challenge"})," [at] ",(0,r.jsx)(n.code,{children:"minizinc.dev"})," and attach an archive containing your problem."]}),"\n"]}),"\n",(0,r.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,r.jsxs)(n.p,{children:['The problem submitter should provide a MiniZinc model of the problem and at least 20 instances ranging\
1nfrom 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 ',u.minizinc," distribution. If you have an instance generator,\nwe are more than happy to receive it."]}),"\n",(0,r.jsxs)(n.p,{children:["The submitted problem must be placed under the\n",(0,r.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,r.jsx)(n.p,{children:"Please follow the links below for submission instructions and requirements."}),"\n",(0,r.jsx)(c.N,{href:`/challenge/${g}`,children:`www.minizinc.org/challenge/${g}`}),"\n",(0,r.jsx)("br",{}),"\n",(0,r.jsx)(c.N,{href:`/challenge/${g}/rules`,children:`www.minizinc.org/challenge/${g}/rules`})]})}function p(e={}){return(0,r.jsx)(x,{...e,children:(0,r.jsx)(j,{...e})})}},80268:(e,n,s)=>{(window.__NEXT_P=window.__NEXT_P||[]).push(["/challenge/2024/call_for_problems",function(){return s(62265)}])},91668:(e,n,s)=>{"use strict";s.d(n,{R:()=>l});var r=s(14232);let i=r.createContext({});function l(e){let n=r.useContext(i);return r.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=80268)),_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.