PageSourceSearch

https://www.minizinc.org/_next/static/chunks/pages/challenge/2013/call_for_problems-75cef3cb82951cf2.js

js minizinc.org collected 2026-09-24 09:27:50 UTC 3,405 bytes, 1 lines download raw bytes

1(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[1714],{28362:(e,n,i)=>{(window.__NEXT_P=window.__NEXT_P||[]).push(["/challenge/2013/call_for_problems",function(){return i(67916)}])},48378:(e,n,i)=>{"use strict";i.d(n,{B:()=>o});var s=i(37876),l=i(69241),r=i(37472);function o({className:e,items:n}){return e=(0,l.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)(r.N,{href:e[1],children:e[0]})]},n))})}},67916:(e,n,i)=>{"use strict";i.r(n),i.d(n,{default:()=>d});var s=i(37876),l=i(63141),r=i(99638),o=i(85931),a=i(37472),t=i(48378),c=i(77328),h=i.n(c);function d(){return(0,s.jsxs)(s.Fragment,{children:[(0,s.jsx)(h(),{children:(0,s.jsx)("title",{children:"MiniZinc - Challenge 2013 Call for Problems"})}),(0,s.jsx)(o.Y,{}),(0,s.jsx)("main",{children:(0,s.jsx)(l.m,{children:(0,s.jsxs)("article",{className:"prose prose-minizinc max-w-none py-6",children:[" ",(0,s.jsx)("h2",{children:"Call for Problem Submission for the MiniZinc Challenge 2013"}),(0,s.jsx)(t.B,{className:"not-prose",items:[["MiniZinc Challenge","/challenge"],["Challenge 2013","/challenge/2013"],"Call for Problems"]}),(0,s.jsx)("p",{children:"The MiniZinc Challenge is an annual solver competition in the Constraint Programming (CP) community held before the International Conference on Principles and Practice of Constraint Programming. The MiniZinc Challenge 2013 is seeking interesting problem sets on which various constraint solving technologies should be compared on this year. Everyone is allowed to submit problems regardless of whether they are an entrant in the challenge."}),(0,s.jsx)("p",{}),(0,s.jsx)("h3",{children:"Important dates and deadlines:"}),(0,s.jsxs)("ul",{children:[(0,s.jsx)("li",{children:"Problem submission open: now "}),(0,s.jsxs)("li",{children:["Problem submission deadline: ",(0,s.jsx)("strong",{children:"Fri, 14 June 2013"})]})]}),(0,s.jsx)("h3",{children:"Problem submission"}),(0,s.jsx)("ul",{children:(0,s.jsxs)("li",{children:["Send an email with the subject line “[MZNC13] benchmark” to mzn-challenge ‘at’ minizinc.org"," "]})}),(0,s.jsx)("p",{children:"There are no restrictions on the kind of problems, but ideally they should be of interesting nature such as practice-related problems and puzzles etc. Problem submissions with real-world instances are welcome warmly. Models for the 2013 challenge can only use integer and Boolean variables."}),(0,s.jsx)("p",{children:"The problem submitter provides a MiniZinc model of the problem and 20 instances ranging from easy-to-solve to hard-to-solve for an “ordinary” CP system. It is strongly encouraged to make use of the global constraint definitions provided in the MiniZinc 1.6 distribution. Please, follow the links below for submission instructions and requirements."}),(0,s.jsxs)("p",{children:[(0,s.jsx)(a.N,{href:"http://www.minizinc.org/challenge/2013",children:"www.minizinc.org/challenge/2013"}),(0,s.jsx)("br",{}),(0,s.jsx)(a.N,{href:"http://www.minizinc.org/challenge/2013/rules",children:"www.minizinc.org/challenge/2013/rules"})]}),(0,s.jsx)("p",{})]})})}),(0,s.jsx)(r.w,{})]})}}},e=>{e.O(0,[7725,8805,6701,4040,6958,636,6593,8792],()=>e(e.s=28362)),_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.