1(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[1814],{48378:(e,i,n)=>{"use strict";n.d(i,{B:()=>t});var s=n(37876),r=n(69241),l=n(37472);function t({className:e,items:i}){return e=(0,r.A)("flex items-center my-4",e),(0,s.jsx)("ul",{className:e,children:i.map((e,i)=>(0,s.jsxs)("li",{className:"flex items-center",children:[i>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]})]},i))})}},65629:(e,i,n)=>{(window.__NEXT_P=window.__NEXT_P||[]).push(["/challenge/2015",function(){return n(72745)}])},72745:(e,i,n)=>{"use strict";n.r(i),n.d(i,{default:()=>d});var s=n(37876),r=n(63141),l=n(99638),t=n(85931),o=n(37472),h=n(48378),c=n(77328),a=n.n(c);function d(){return(0,s.jsxs)(s.Fragment,{children:[(0,s.jsx)(a(),{children:(0,s.jsx)("title",{children:"MiniZinc - Challenge 2015"})}),(0,s.jsx)(t.Y,{}),(0,s.jsx)("main",{children:(0,s.jsx)(r.m,{children:(0,s.jsxs)("article",{className:"prose prose-minizinc max-w-none py-6",children:[(0,s.jsx)("h2",{children:"MiniZinc Challenge 2015"}),(0,s.jsx)(h.B,{className:"not-prose",items:[["MiniZinc Challenge","/challenge"],"Challenge 2015"]}),(0,s.jsx)("h3",{children:"The Challenge"}),(0,s.jsx)("p",{children:"The aim of the challenge is to start to compare various constraint solving technology on the same problems sets. The focus is on finite domain propagation solvers. An auxiliary aim is to build up a library of interesting problem models, which can be used to compare solvers and solving technologies."}),(0,s.jsxs)("p",{children:["Entrants to the challenge provide a FlatZinc or MiniZinc solver and global constraint definitions specialized for their solver. Each solver is run on 100 MiniZinc model instances. For FlatZinc solvers, we run the translator ",(0,s.jsx)("tt",{children:"mzn2fzn"})," on the MiniZinc model and instance using the provided global constraint definitions to create a FlatZinc file. The FlatZinc file is input to the provided FlatZinc solver. For MiniZinc solvers, the MiniZinc model and instance are input to the provided solver. Points are awarded for solving problems, speed of solution, and goodness of solutions (for optimization problems)."]}),(0,s.jsx)("h3",{children:"Announcements"}),(0,s.jsx)("p",{}),(0,s.jsxs)("ul",{children:[(0,s.jsxs)("li",{children:[(0,s.jsx)("b",{children:"2016-05-19"})," A minor bug in the scoring script was fixed and ",(0,s.jsx)(o.N,{href:"/challenge/2015/results",children:"the results"})," have been updated correspondingly. Thanks to Mohamed Siala for reporting the bug."]}),(0,s.jsxs)("li",{children:[(0,s.jsx)("b",{children:"2015-09-04"})," Announcement of the results available"," ",(0,s.jsx)(o.N,{href:"/challenge/2015/results",children:"here"}),"."," "]}),(0,s.jsxs)("li",{children:[(0,s.jsx)("b",{children:"2015-08-03"})," Final submission deadline is now"," ",(0,s.jsx)("strong",{children:"Thu, 6 August 2015"}),"."]}),(0,s.jsxs)("li",{children:[(0,s.jsx)("b",{children:"2015-07-10"})," Upgrade of MiniZinc distribution to 2.0.4 on the competition VMs. Updated the rules accordingly."]}),(0,s.jsxs)("li",{children:[(0,s.jsx)("b",{children:"2015-06-24"})," Announcement of MiniZinc Challenge Judges."," "]}),(0,s.jsxs)("li",{children:[(0,s.jsx)("b",{children:"2015-06-24"})," Official Call for Participation for the MiniZinc Challenge has been made."," "]}),(0,s.jsxs)("li",{children:[(0,s.jsx)("b",{children:"2015-04-23"})," Initial"," ",(0,s.jsx)(o.N,{href:"/challenge/2015/call_for_problems",children:"Call for MiniZinc Problems"})," ","has been made."," "]})]}),(0,s.jsx)("h3",{children:"Dates"}),(0,s.jsxs)("ul",{children:[(0,s.jsxs)("li",{children:["Registration opens: ",(0,s.jsx)("strong",{children:"Wed, 26 June 2015"}),"."," "]}),(0,s.jsxs)("li",{children:["Problem submission deadline: ",(0,s.jsx)("strong",{children:"Fri, 5 June 2015"}),"."," "]}),(0,s.jsxs)("li",{children:["Initial submission round begins:"," ",(0,s.jsx)("strong",{children:"Sat, 4 July 2015"}),"."," "]}),(0,s.jsxs)("li",{children:["Initial submission round ends:"," ",(0,s.jsx)("strong",{children:"Sat, 25 July 2015"}),"."," "]}),(0,s.jsxs)("li",{children:["Final submissions:"," ",(0,s.jsxs)("strong",{children:[(0,s.jsx)("del",{children:"Sat, 1 August 2015"})," Thu, 6 August 2015"]}),"."," "]}),(0,s.jsxs)("li",{children:["Announcement of results at"," ",(0,s.jsx)(o.N,{href:"http://cp2015.a4cp.org",children:(0,s.jsx)("abbr",{children:"CP2015"})}),": ",(0,s.jsx)("strong",{children:"31 August - 4 September 2015"}),"."," "]})]}),(0,s.jsx)("h3",{children:"Registration"}),(0,s.jsxs)("p",{children:["Entrants must register their intention to enter the contest"," ",(0,s.jsx)("em",{children:"before"})," the first submission round.",(0,s.jsx)("br",{})," The first submission round is an opportunity for us to provide feedback concerning your entry; it does not count towards the final result.",(0,s.jsx)("br",{})," Feel free to register and later withdraw."]}),(0,s.jsx)("p",{children:"To register send an email with the following subject line"}),(0,s.jsx)("pre",{children:(0,s.jsx)("kbd",{children:"[MZNC15] registration"})}),(0,s.jsx)("p",{children:"to"}),(0,s.jsxs)("pre",{children:[(0,s.jsx)("kbd",{children:"mzn-challenge"})," âatâ ",(0,s.jsx)("kbd",{children:"minizinc.org"})]}),(0,s.jsx)("p",{children:"In the body of the email please include an email address at which we can contact you."}),(0,s.jsx)("h3",{children:"Submission"}),(0,s.jsx)("p",{children:"We will provide submission details via email to the address provided above."}),(0,s.jsx)("h3",{children:"Problem Submission"}),(0,s.jsx)("p",{children:"We strongly encourage all entrants to submit one or tw
1o MiniZinc models satisfying the contest requirements, together with instances for these models. They can be submitted as tarballs to:"}),(0,s.jsxs)("pre",{children:[(0,s.jsx)("kbd",{children:"mzn-challenge"})," âatâ ",(0,s.jsx)("kbd",{children:"minizinc.org"})]}),(0,s.jsxs)("p",{children:["The sooner they are submitted the better, the deadline is"," ",(0,s.jsx)("strong",{children:"Fri, 5 June 2015"}),". The call for problem submission is available"," ",(0,s.jsx)(o.N,{href:"/challenge/2015/call_for_problems",children:"here"}),". Please feel free to distribute it."]}),(0,s.jsx)("h3",{children:"Rules"}),(0,s.jsxs)("p",{children:["The rules for the MiniZinc Challenge 2015 are available"," ",(0,s.jsx)(o.N,{href:"/challenge/2015/rules",children:"here"}),".",(0,s.jsx)("br",{})," If we need to make changes to the rules, all registered entrants will be informed by email."]}),(0,s.jsx)("h3",{children:"Judges"}),(0,s.jsx)("p",{children:"The judges will be responsible for selecting the tested instances, vetting the results, and ruling on any questions that arise during the competition."}),(0,s.jsxs)("ul",{children:[(0,s.jsx)("li",{children:" Jimmy H.M. Lee. Chinese University of Hong Kong. "}),(0,s.jsxs)("li",{children:[" ","Barry O'Sullivan, Cork Constraint Computation Center."," "]}),(0,s.jsx)("li",{children:" Roland Yap, National University of Singapore. "})]}),(0,s.jsx)("p",{}),(0,s.jsx)("h3",{children:"Feedback"}),(0,s.jsx)("p",{children:"This is the seventh time this challenge is run, and there are many possibilities for comparing CP solvers. The rules try to make a sensible set of choices for the comparison. We would welcome any comments or suggestions regarding the running of this challenge."}),(0,s.jsx)("p",{children:"We can be contacted with the subject starting with [MZNC15] at:"}),(0,s.jsxs)("pre",{children:[(0,s.jsx)("kbd",{children:"mzn-challenge"})," âatâ ",(0,s.jsx)("kbd",{children:"minizinc.org"})]}),(0,s.jsx)("h3",{children:"MiniZinc forums"}),(0,s.jsxs)("p",{children:["The"," ",(0,s.jsx)(o.N,{href:"https://groups.google.com/forum/#!forum/minizinc",children:"MiniZinc forum"})," ","is for beginners, users, and developers to discuss MiniZinc. If you would like to join then sign up for the"," ",(0,s.jsx)(o.N,{href:"https://groups.google.com/forum/#!forum/minizinc",children:"MiniZinc forums"}),"."]}),(0,s.jsx)("h3",{children:"Links"}),(0,s.jsxs)("p",{children:["The ",(0,s.jsx)(o.N,{href:"/",children:"MiniZinc"})," page includes a list of resources related to MiniZinc and FlatZinc."]}),(0,s.jsxs)("p",{children:["The"," ",(0,s.jsx)(o.N,{href:"/downloads#releases-title",children:"MiniZinc 2.0 Distribution"})," ","includes a MiniZinc-to-FlatZinc converter and a large suite of MiniZinc examples and benchmarks."]}),(0,s.jsxs)("p",{children:["The ",(0,s.jsx)(o.N,{href:"/challenge/2014",children:"MiniZinc Challenge 2014"})," ","webpage, include the results from the previous year."]}),(0,s.jsxs)("p",{children:["The ",(0,s.jsx)(o.N,{href:"/challenge",children:"MiniZinc Challenges 2008-2014"})," ","webpage, include the results from each MiniZinc Challenge."]})]})})}),(0,s.jsx)(l.w,{})]})}}},e=>{e.O(0,[7725,8805,6701,4040,6958,636,6593,8792],()=>e(e.s=65629)),_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.