Skip to main content
Filter by
Sorted by
Tagged with
3 votes
1 answer
84 views

We are currently working on a package utilizing the constraint programming solver Gecode (6.2). For the sake of usability we would like to include the Gecode source files with the package, so users do ...
Nils Lüschow's user avatar
0 votes
1 answer
41 views

I want minizinc to find solution in a particular order to minimize the overlap with existing solutions. Sort of bredth first search instead of depth first search, if that makes sense. I am using a ...
Krishna's user avatar
  • 1,632
1 vote
1 answer
145 views

Are there any constraint solvers that can understand exponentiation of potentially unbounded floats aka. real numbers? Given this simple program, var float: x; constraint x^x = 27; solve satisfy; I ...
P Varga's user avatar
  • 20.4k
0 votes
1 answer
125 views

I use MiniZinc 2.7.6 and Gecode 6.3.0 when I run the below block of code: int: user_property_1 = 1; % user_property_1-parameter int: user_property_2 = 2; % user_property_2-parameter int: ...
user2829319's user avatar
0 votes
0 answers
77 views

I am just getting started with Gecode element constraints. It seems to hang when the list elements are too far apart. Here is the full program to demonstrate the issue, with a few knobs (MACROS) to ...
Krishna's user avatar
  • 1,632
1 vote
1 answer
63 views

As per the Gecode documentation "Modelling and Programming with Gecode", an IntVar can be created with IntSet This is also confirmed by Gecode's reference for IntVar at https://www.gecode....
Krishna's user avatar
  • 1,632
0 votes
0 answers
197 views

I'm trying to rum my minizinc model through python but it seem to be a problem with the solver Gecode. I've tryed using a simpler model but the result is the same. If i use another solver like chuffed ...
Giacomo Gaiani's user avatar
1 vote
1 answer
451 views

For full context, my goal is to implement an "agent" that attempts to learn the best heuristic from a given pool in an online fashion (meaning that the learning and the solving procedures ...
ludorey's user avatar
  • 11
0 votes
1 answer
46 views

I am getting a segmentation fault when I attempt to run examples/<some example> after my installation of Gecode. I configured before make with ./configure -with-gmp-include=/usr/include/x86_64-...
fatm's user avatar
  • 65
1 vote
1 answer
299 views

I am currently trying to develop a (fairly basic) model in Minizinc. I have reached a point up until now, where I can run the model and a satisfactory solution is found (basically calling "solve ...
small_cat_destroyer's user avatar
0 votes
1 answer
434 views

I am trying to create a function in MiniZinc that can determine the distance between a line and a point. I want the function to only use integers. My idea is as follows: In the case the point is not ...
Wouter Morssink's user avatar
1 vote
1 answer
368 views

I am building a simple model on Minizinc 2.5.3 (latest version) and Gecode 6.3.0 to try and organize a weapons production operation. When running the code, the following error appears: Error: Gecode: ...
pms0765's user avatar
  • 13
0 votes
1 answer
152 views

I am trying to learn gecode and am trying to get the example found here to work. // To use integer variables and constraints #include <gecode/int.hh> // To make modeling more comfortable #...
sail0r's user avatar
  • 461
0 votes
1 answer
349 views

Does the input ( boolean and arithmetic equations ) order matters to the constraint solvers like Gecode and SMT solvers like microsoft Z3 ?? If yes, which one of these two will perform better provided ...
xyz's user avatar
  • 1
0 votes
1 answer
266 views

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 ...
user13387285's user avatar
0 votes
1 answer
1k views

can someone give me examples that can be solved using SMT solver ( like microsoft z3 ) but cant be solved by constraint solvers ( like Gecode ) ?? What is the basic difference between constraint ...
user13387285's user avatar
2 votes
1 answer
266 views

I am trying to solve linear equation 15 * x + y + 0.4*z == 100 using gecode. I want to print the values of x,y,z. But, when i run following code, class LinearEq1 : public Space { protected: ...
user13387285's user avatar
1 vote
1 answer
718 views

I'm looking for a C++-based alternative to the SystemVerilog language. While I doubt anything out there can match the simplicity and flexibility of the SystemVerilog constraint language, I have ...
squirem's user avatar
  • 247
3 votes
2 answers
562 views

I am using minizinc with built-in Gecode 6.1.1 and I want to maximize an objective function with values that are far greater than the max int 32. The maximum value of an integer with 32 bits is ...
Spyros K's user avatar
  • 2,625
0 votes
2 answers
464 views

I am new to CMake, and need some directions on a simple issue: I build the gecode from source in my Ubuntu 18.04 machine by following this link. The library is installed in /opt/gecode-release-6.2.0 ...
Taozheng Yang's user avatar
0 votes
1 answer
218 views

I use Ubuntu 18.04 and try to compile the example 'money.cpp' file that Gecode brings. I downloaded (gecode-release-5.1.0.tar.gz) and extract it. Then to install Gecode I do the following steps: (1) ....
GMs's user avatar
  • 47
0 votes
2 answers
278 views

I use Gecode through its C++ API in a kind of learning context with positive and negative examples. In this context I have two BoolVarArray: positive_bags_ and negative_bags_. And what I want to do ...
Heleo's user avatar
  • 25
0 votes
1 answer
82 views

I'm working on a GECODE solver to implement a Matrix Generation problem. I have figured out all the constraints I require except for one: Given a Matrix[M, N], all column vectors must be pairwise ...
BlamKiwi's user avatar
  • 2,243
1 vote
1 answer
109 views

I just want to know if both these two MiniZinc solver use infinite precision arithmetic by default.
Francesco Contaldo's user avatar
2 votes
1 answer
141 views

I installed Gecode 6.0 for VS 2017. Added directories to /lib and /include. Then included gecode/int.hh to the Hello World program. During compilation got 3 strange errors: Error C2084 function "...
Jakub Pawlak's user avatar
1 vote
1 answer
410 views

I wrote a large minizinc model including var variables with int_search statement for proper ordering. It contains output statement in which I use fix(var variables) statements to output the variable ...
Rajat Gupta's user avatar
2 votes
1 answer
238 views

I post here to ask if there is a way to alternate different strategies of branching. Let me explain, I have an efficient branching strategy which we'll call the strategy A. The biggest problem is that ...
Missu's user avatar
  • 505
2 votes
1 answer
133 views

I am trying to use a merit function for my branching in Gecode. In the MPG, the Gecode Manual, an example merit function is stated, and how to pass it to the branching. But I cannot figure out where ...
Atonic's user avatar
  • 559
2 votes
1 answer
247 views

In Gecode, I am using a merit function to select variables when branching. In order to compute variable v's merit, I need to access some other variables values, but it looks like at the time the ...
Silverspur's user avatar
6 votes
1 answer
2k views

The MiniZinc constraint solver allows to express cardinality constraints very easily using the built-in sum() function: % This predicate is true, iff 2 of the array % elements are true predicate ...
Axel Kemper's user avatar
  • 11.5k
4 votes
1 answer
838 views

I have a simple question regarding the Minizinc's syntax. My input .dzn file contain a set of 2 dimentional arrays (approximately up to 30 arrays), declared as follows: rates_index_0 = array2d(1..3, ...
kirbo's user avatar
  • 1,747
1 vote
0 answers
62 views

Linear equations/inequations can be easily solved by simplex algorithm which is very fast. But for GECODE solver we only have two propagators : domain and bounds which solve the constraints that have ...
Rajat Gupta's user avatar
2 votes
1 answer
262 views

I am using minizinc and gecode to solve a minimization problem in a distributed fashion. I have multiple distributed servers that solve the same model with identical input and I want all the servers ...
kirbo's user avatar
  • 1,747
1 vote
1 answer
38 views

I am modeling algorithm to hardware mapping with Gecode and standard Gecode::Int::Limits is too small at least because I want to target systems with more than 2^32 memory. Is there a way to get use ...
Slaus's user avatar
  • 2,230
2 votes
2 answers
527 views

I have the following minizinc model: include "globals.mzn"; var 0..9: A_1_1; var 0..9: A_2_1; var 0..9: A_3_1; constraint (A_3_1+A_2_1+A_1_1) = A_1_1; solve satisfy; The model should have the trivial ...
Martin's user avatar
  • 35
3 votes
2 answers
672 views

I have a simple model written in minizinc and I use gecode to solve it by compiling it into flat-zinc first. As an input, the model takes some constants, arrays, and matrices (in the form of 2-...
kirbo's user avatar
  • 1,747
0 votes
1 answer
445 views

I would like to solve a model with dynamic arguments at run-time in Java. I have my problem written in MiniZinc. From a terminal I can solve the model by calling the following commands: mzn2fzn ...
kirbo's user avatar
  • 1,747
0 votes
0 answers
38 views

I need to express a constraint for 2 integer Arrays of the same size x_i = x_j => y_i = y_j in other words, there is an integer function such x = f(y) Is there any solutions for it?
Solon's user avatar
  • 372
1 vote
0 answers
123 views

it's Gecode c++ I have an IntVarArgs value of length n and I want to push a constraint that each value in array appears at least k times (or 0) f.e array [1, 2, 3, 1, 2, 3, 4, 4, 4] satisfies this ...
Solon's user avatar
  • 372
1 vote
0 answers
43 views

I work with Gecode on C++ I have two IntVarArgs variables both of length of n, with domain from 0 to k I need a constraint expression that counts unique pairs between these 2 arrays f.e I want ...
Solon's user avatar
  • 372
0 votes
1 answer
88 views

Problem : Given a labeled(1..n) undirected graph, create a model in Gecode for finding a supergraph with a given sequence degree: Difficulties: the main difficulty is to find fancy model to ...
Solon's user avatar
  • 372
-1 votes
1 answer
1k views

Please i need your help. I have installed the toolkit for developing constraint-based systems and applications Gecode 4.4.0 on Windows 8, also the compilator C++ Dev C++ 5.9.2 but i still don't know ...
bilelovitch's user avatar
  • 2,215
2 votes
0 answers
109 views

I'd like to use the open-source Gecode (gecode.org) framework for constraint programming within R. So far I did not found any direct route. I found lots of bindings and interfaces to Ruby, Python, ...
user2030503's user avatar
  • 3,114
1 vote
1 answer
282 views

I'm implementing a simple model in Minizinc to schedule tasks with different priority and duration in a series of time slots, but not all the tasks can be scheduled so some will be left out and I'm ...
siritinga's user avatar
  • 4,251
1 vote
0 answers
414 views

I am a beginner with minizinc and optimization. I am trying to flesh out a curve of points where only average decile statistics are available. Here is my model: array[1..10] of float: deciles; ...
Graeme's user avatar
  • 11
1 vote
1 answer
368 views

I'm implementing a custom sum propagator in GeCode. The problem I'm trying to model involves a number of sum constraints each of which can be propagated further according to a problem-specific ...
Niels Søholm's user avatar
3 votes
2 answers
2k views

I'm familiarizing with the basic of MiniZinc. So, armed with the MiniZinc IDE, I write snippets like solve satisfy; string: s1 = "hello"; string: s2 = "world"; function list of int: cdr(list of int:...
CapelliC's user avatar
  • 60.1k
0 votes
1 answer
257 views

I am using GeCode to build a software for solving a specific task. I modeled my problem using integer set variables and some constraints over these variables. But for the matter of this question, let ...
Nightzus's user avatar
0 votes
3 answers
226 views

I'm looking for a way to copy Space instances in Gecode and then analyze the difference between the spaces later. However it goes already wrong after the first copy. When one copies the code in the ...
willeM_ Van Onsem's user avatar
0 votes
1 answer
145 views

Gecode uses Spaces to represent the constraint satisfaction problem in progress: each time a decision point is reached, the Space is copied. I want to perform analysis on these spaces in progress. Is ...
willeM_ Van Onsem's user avatar