constraint-programming

问题 I am newbie in CP but I want to solve problem which I got in college. I have a Minizinc model which minimize number of used Machines doing some Tasks. Machines have some resource and Tasks have resource requirements. Except minimize that number, I am trying to minimize cost of allocating Tasks to Machine (I have an array with cost). Is there any chance to first minimize that number and then optimizate the cost in Minizinc? For example, I have 3 Task and 2 Machines. Every Machine has enough

问题 I am newbie in CP but I want to solve problem which I got in college. I have a Minizinc model which minimize number of used Machines doing some Tasks. Machines have some resource and Tasks have resource requirements. Except minimize that number, I am trying to minimize cost of allocating Tasks to Machine (I have an array with cost). Is there any chance to first minimize that number and then optimizate the cost in Minizinc? For example, I have 3 Task and 2 Machines. Every Machine has enough

问题 I'm wondering if there is a generalisation of solver.AllDifferent(x) in google or-tools that allows for the specification of how many different elements I allow. So if len(x) = 4, then AllDifferent(x) means that len(set(x)) = 4. But what if I just want to enforce "at least 2 different", so: len(set(x)) >=2 ? Is there a constraint that generalises AllDifferent to be able to set the cardinality of the solution variable ? 来源： https://stackoverflow.com/questions/48021694/make-k-different

来源： https://stackoverflow.com/questions/62709374/create-a-matrix-based-on-given-constraints

来源： https://stackoverflow.com/questions/62709374/create-a-matrix-based-on-given-constraints

来源： https://stackoverflow.com/questions/26723337/using-the-prolog-in-scala-to-find-available-type-class-instances

问题 In constraint solver like Gecode , We can control the exploration of search space with help of branching function. for e.g. branch(home , x , INT_VAL_MIN ) This will start exploring the search space from the minimum possible value of variable x in its domain and try to find solution.(There are many such alternatives .) For z3, do we have this kind of flexibility in-built ?? Any alternative possible?? 回答1: SMT solvers usually do not allow for these sorts of "hints" to be given, they act more

问题 I'm trying to get familiar with constraint programming. All documentation/videos I've seen so far just contain description of top-level concepts and code examples based on CP-libraries utilization (like Choko, Gecode, JaCoP etc). I'd like to implement at least something simple in Java without any libraries. Are there any resources where I can find working code in Java/C#/C++/Python which implements main CP ideas? (at least "send more money" problem solution). (or, maybe, if somebody can

问题 Can someone provide a simple example of channelling constraints? Channelling constraints are used to combine viewpoints of a constraint problem. Handbook of Constraint Programming gives a good explanation of how it works and why it can be useful: The search variables can be the variables of one of the viewpoints, say X1 (this is discussed further below). As search proceeds, propagating the constraints C1 removes values from the domains of the variables in X1. The channelling constraints may

问题 Here I propose to find a solution to Smullyan's numerical machines as defined here. Problem statement They're machines that take a list of digits as input, and transform it to another list of digits following some rules based on the pattern of the input. Here are the rules of the machine given in the link above, expressed a bit more formally. Let say M is the machine, and M(X) is the transformation of X. We define a few rules like this: M(2X) = X M(3X) = M(X)2M(X) M(4X) = reverse(M(X)) //