Activity for JaCoPhttps://sourceforge.net/p/jacop-solver/activity/Recent activity for JaCoPenTue, 23 Jan 2018 09:57:46 -0000openfokus posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#39afKris, I will checkout the example that uses SimpleMatrixSelect. And yes, I get faster results when I restrict the placement space like you suggested. I think that the main problem for the moment is the way I detect overlaps and crossings. There are at least two strategies: . use a pairing function (Matthew Szudzik Wolfram Research, Inc) to get a unique hash for every coordinate on the rectangle borders and for each point of each wire. Then I can say AllDistinct. The problem is that I get into thousands...openfokusTue, 23 Jan 2018 09:57:46 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#39afkris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#0b88Two more comments. You may also check SimpleMatrixSelect where you can specify an array of variables (vector of vectors) and select the whole sub-vector for labeling. Your problem conatin symmetries that you may eliminate to get faster proof of optimality. There is several methods to do that. A simple one fixes, for example, one rectangle, into left top "quarter" of the ålacement space. /KriskrisTue, 23 Jan 2018 09:33:48 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#0b88openfokus posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#6bdfRado, Kris Thank you very much for your detailed comments and suggestions. For me, they greatly simplify the first steps in the realms of CP. I initially thought that CP is all about modelling your problem in terms of constraints (drawing from the nice "library" that Jacop offers) and that the search part - at least for "small" problems - is an afterthought, much like when you use a SQL database. In traditional SQL (or no-sql), once your problem is modelled in terms of entities and relationships...openfokusTue, 23 Jan 2018 09:05:58 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#6bdfkris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#a419Hi! I just realized that you have two "types" of variables. Variables a_i and b_i. It might be good to use in such case sequence of searches. First on varibales a and then on variables b. For example, the search can be defined as below. Search<IntVar> slave = new DepthFirstSearch<IntVar>(); SelectChoicePoint<IntVar> selectSlave = new SimpleSelect<IntVar>(varsB, new SmallestMin<IntVar>(), new SmallestDomain<IntVar>(), new IndomainMin<IntVar>()); slave.setSelectChoicePoint(selectSlave); Search<IntVar>...krisTue, 23 Jan 2018 07:35:59 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#a419Radoslaw Szymanek posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#bd95Hi, I just put one longer response concerning your questions Peter. First, CP is often used to model and solve NP-complete and NP-hard problems. I assume your problem belongs to one of these. For those classes of problems finding the right search approach is something that even CP experts after years of experience will need to apply trial and see approach.We will have some hunches when we see actual problem but the only way to get good at it is to see existing solutions to similar problems and try...Radoslaw SzymanekMon, 22 Jan 2018 21:58:52 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#bd95openfokus posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#9e38Only InputOrderSelect works on all my problems, provided that I present the vars in the "right" order. Is there some theory / paper that I could read to better understand that, since this seems to be a killer problem ? Also, I feel that this problem should appear big in the guide. I only discovered this by chance because the first ordering I used happened to work and I already had unit tests in place. Otherwise I would have put the validity of my model in doubt, rather than choosing different parameters...openfokusMon, 22 Jan 2018 16:19:50 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#9e38kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#2692Yes, the order matters, specially if you use InputOrder variable selection heuristic. Try other heuristics, such as SmallestDomain or MostConstrainedStatic. Since the variable are selected based on specific criteria during search they are less dependent by the orde rof variables. /KriskrisMon, 22 Jan 2018 14:56:11 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#2692openfokus posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#49fb/e446In the meantime I have refactored and all vars are presented to the SelectChoicePoint. Now I have noticed that apparently the order in which vars are presented does matter. For example: (a1, a2, ,,, an, b1, b2, ... bn) has a solution but: (b1, b2, ,,, bn, a1, a2, ... an) has not. Is this possible ? Thanks, PeteropenfokusMon, 22 Jan 2018 14:43:17 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#49fb/e446kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#49fbThanks for your comment. We have introduced this boolean variable to limit number of the solutions, specially for sequence of searches. It is not really reflected in the Guide. Thanks. /KriskrisMon, 22 Jan 2018 11:05:48 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#49fbopenfokus posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#5a11/d4ceThanks Kris, I appreciate your help. Might I suggest one thing: When using a custom CostListener as explained on pp. 51 of the guide, I found it confusing that the returnCode is not honoured unless I say: search.respectSolutionListenerAdvice = true; First, this is a public field while most other fields have their setters. Second its not on the Search interface but only in its subclass DepthFirstSearch. In my problem, the best ( minimal cost) solution is often not the first one, but rather the fifth...openfokusMon, 22 Jan 2018 10:18:33 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#5a11/d4cekris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#5a11Right! The performance overhead will not be so high if all FDVs in the "additional" search are ground (got a value by propagation). In this case we basically check them and skip them in search. Good luck with your problem, /KriskrisMon, 22 Jan 2018 09:57:08 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#5a11openfokus posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#61e0/0262So to resume: If I want to be sure that the result I get is a coherent solution, I need to include all FDVs in the search, even if this might increase the search time. If this turns out to be too much overhead, I must check after the search if constraint propagation has reached all variables to make sure that the result is correct. And to resume even more: always include all FDVs in the search unless the performance hit is not acceptable. Is this correct ? Thanks, PeteropenfokusMon, 22 Jan 2018 09:53:31 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#61e0/0262kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#61e0Hi Peter, In this paragraph I talk on possible situation that might happen for not very careful programmers. Regarding your example, it depends what you will include in vector s. If you only, for example, include only part of decision variables it might happen that other decision variables do not get a single value (by propagation) and even worse, the other variables might not have in their domains possible correct values. Best, /KriskrisMon, 22 Jan 2018 09:22:43 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#61e0openfokus posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#5db8/d4a2Hi Kris, thank you I don't quite understand the second paragraph in your reply. "when the solution found by labeling variables specified by the programmer is not part of the correct solution.. " How can that happen. I would have thought, that the variables that I submit to the search like this: SelectChoicePoint<IntVar> select = new InputOrderSelect<IntVar>(s, toArray(ivs), new IndomainMin<IntVar>()); will always contain the correct solution after the search (by correct I understand not necessarily...openfokusMon, 22 Jan 2018 09:11:38 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#5db8/d4a2kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#5db8In general, the search will take longer time since we need to label more variables. This "overhead" is problem specific and it might be very small or very large. Note, however, that in special situations, when the solution found by labeling variables specified by the programmer is not part of the correct solution, the additional search might be long to find this situation and return to the original search. /KriskrisMon, 22 Jan 2018 07:42:24 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#5db8openfokus posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#4d7dSo, is there any downside in systematically including all vars ( including intermediate ones) in the search ? PeteropenfokusSun, 21 Jan 2018 19:07:33 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#4d7dkris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#0f58Formally, you csan only be sure that the result is correct if all FDVs get a single value but ... in many pratcial cases intermediate variables get values by propagation. This is probably the case for your exasmple. If you give a value to a then a * a will propagate. I think a good idea is to print the store when you get a solution and check if all variables get a value. Alternatively you can add a slave search that gives values to all intermediate variables. Best, /KriskrisSun, 21 Jan 2018 16:19:40 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#0f58openfokus posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#512aI use a lot of intermediary IntVar ( like a * a ) in my model and I don't care about their values ( of course, they are added to the store). Do I need / should I present these to DepthFirstSearch call anyway ? I seem to get correct results either way, but I was wondering if the choice to include/not to include intermediary vars in the search has any consequence ( including performance-wise). PeteropenfokusSun, 21 Jan 2018 15:39:10 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/bf397201/?limit=25#512aRadoslaw Szymanek posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/140fc4df/?limit=25#f3e1Hi, I have difficult understanding your post. Therefore, my answer my not be sufficient for you. Look at how ExampleFD is used by one of our examples. Create your own example in your package in the project. Make your class use ExampleFD. ExampleFD is just convienance class that you do not have to use it. You could just copy paste some of the code from this class to your class and you will be ok too. You could to study a bit how to start a project in Intelij, create Java classes, etc and youtube will...Radoslaw SzymanekTue, 09 Jan 2018 06:40:04 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/140fc4df/?limit=25#f3e1Fulga Dan modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/140fc4df/?limit=25#cd28As part of an AI college assignment, I chose to use JaCoP, to understand how it works and finally demonstrating that in my own examples. My problem is: in order to see if the classes (puzzles) I built and solved were succesfull, I tried to work in IntelliJ, but there there is no chance for me to create a new class in the examples directory, so i considered writing over one already presented by you, but that's also impossible, even though I already checked the boxes to enable writing into the files....Fulga DanThu, 04 Jan 2018 01:28:45 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/140fc4df/?limit=25#cd28Fulga Dan posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/140fc4df/?limit=25#cd28As part of an AI college assignment, I chose to use JaCoP, to understand how it works and finally demonstrating that in my own examples. My problem is: in order to see if the classes (puzzles) I built and solved were succesfull, I tried to work in IntelliJ, but there there is no chance for me to create a new class in the examples directory, so i considered writing over one already presented by you, but that's also impossible, even though I already checked the boxes to enable writing into the files....Fulga DanThu, 04 Jan 2018 01:20:49 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/140fc4df/?limit=25#cd28kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#2e24One possible example is at https://github.com/hakank/hakank/blob/master/minizinc/graph_partition.mzn /KriskrisThu, 09 Nov 2017 09:05:23 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#2e24Pangiotis posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#d658i am totally confused is there any github example to take a look or any sample of the basic code.PangiotisThu, 09 Nov 2017 00:39:26 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#d658kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#6be6If all weights are 1 then you can skip multiplication by w[i]. /KriskrisWed, 08 Nov 2017 09:43:26 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#6be6Pangiotis posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#aab1thanks for this approach, but my problem has equal weights(1 for all) of each edge. Consider this approach to briefly understand it here . What do you suggest for this approach?PangiotisWed, 08 Nov 2017 09:31:46 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#aab1kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#9cb0I would do the following. I define variable p[i] for each node i and then define the partitioning cost, for example, as number of edges that go between partitions. This can be definef as cost = sum (i in 1..n, j in i+1..n) ( (x[i] != x[j]) * w[i]); where w[i] defines the "weight" of the edge or numbe rof edges going between two nodes. Then we can minimize the cost of partitioning. /KriskrisWed, 08 Nov 2017 08:56:05 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#9cb0Pangiotis posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#d010what do i need to use to solve the graph partition problem instead of sets then? i will appreciate a lot if you might give me some directionsPangiotisWed, 08 Nov 2017 08:14:01 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#d010kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#00e0You are using a set and sets do not have multiplple emenets and therefore it is not possible. Sorry! /KriskrisWed, 08 Nov 2017 06:30:45 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#00e0Pangiotis posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#8209yes but what about if i want to add multiple edges for my graph partion problem except from {1.3}. For example i want to have to simulate edges of the graph d :: {{1,3}..{2,4}..{3,2} etc }.what i do in this occasion? i was trying to do d.unionAdapt(1,3); d.unionAdapt(2,4); but it not works for the second elementPangiotisWed, 08 Nov 2017 01:26:49 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#8209kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#5e8cYou can do it by constracring IntervalDomain to values you want. For example SetVar v = new SetVar(store, "v", new BoundSetDomain( new IntervalDomain(1, 2), new IntervalDomain(1, 10))); will create v::{{1..2}..{1..10}}[card={2..10}] If you want glb = {1,3} you need to create IntervalDomain constaining 1 and then add 3. For example d = new IntervalDomain(1, 1); d.unionAdapt(3,3); This should give you d :: {{1,3}..{1..3}}[card=2..3}] You may also use addElement method from IntervalDomain. I hope it...krisTue, 07 Nov 2017 08:47:48 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#5e8cPangiotis posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#d6adi am trying to simulate the The Graph Partitioning Problem but i am bit confused. i defined a collection of integers using "Set Constraints" but my problem is that Set with BoundSetDomain is defined with glb(d) = {1}, set containing element 1, and lub(d) = {1..3}, set containing elements 1, 2 and 3. For example, i want to have exaclty a set of {1,3} and not {1..3}, with 1, 2 and 3. What can i do here can you help me?PangiotisMon, 06 Nov 2017 16:16:03 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/00f2cfa3/?limit=25#d6adJaCoP released /JaCoP-4.5/jacop-4.5.0.jarhttps://sourceforge.net/projects/jacop-solver/files/JaCoP-4.5/jacop-4.5.0.jar/downloadJaCoPWed, 25 Oct 2017 09:06:02 -0000https://sourceforge.net/projects/jacop-solver/files/JaCoP-4.5/jacop-4.5.0.jar/downloadJaCoP released /JaCoP-4.5/minizinc_jacop_lib.ziphttps://sourceforge.net/projects/jacop-solver/files/JaCoP-4.5/minizinc_jacop_lib.zip/downloadJaCoPWed, 25 Oct 2017 09:06:01 -0000https://sourceforge.net/projects/jacop-solver/files/JaCoP-4.5/minizinc_jacop_lib.zip/downloadkris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#7451Hi again, Yes, please use AndBoolVector. AndBoolSimple is only in the solver to define 2-input parameter constraints and to be a little bit more efficient than general n-input parameter AndBoolVector. In most cases it does not matter very much. AndBool is a wrapper that generates either AndBoolSimple or AndBoolVector In the forthcomming release of version 4.5 we define AndBool as a decomposed constraint and therefore it cannot be used as parameter to other constraints (it must be primitive constraint)....krisMon, 17 Jul 2017 05:37:45 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#7451A. M. Grubb posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#346a/3ac4Alright, I can use AndBoolVector in the mean time. Approximately, when is the new version coming out? Thanks for your help diagnosing the problem! AliciaA. M. GrubbSun, 16 Jul 2017 15:18:37 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#346a/3ac4kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#346aHi! You are right. it is a bug in version 4.4. It works with AndBoolSimple but not with AndBool that makes conversion to AndBoolSimple or AndBooVector. However, it should work with AndBoolVector. Thanks for pointing this problem. It is already fixed for the new release. Best, /KriskrisSun, 16 Jul 2017 14:52:03 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#346aA. M. Grubb posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#2908I thought there might be a problem with the automatic conversion between AndBool and AndBoolSimple, so I added an additional variable and I still get the store.consistency() = false. store = new Store(); IntVar L0 = new IntVar(store, "L0", 1, 100); IntVar TA0 = new IntVar(store, "TA0", 0, 0); IntVar[] links = new IntVar[3]; links[0] = new IntVar(store, "N0001_0_FS", 0, 0); links[1] = new IntVar(store, "N0002_0_FS", 0, 1); links[2] = new IntVar(store, "N0001_0_FS", 0, 1); IntVar N0000_0_FS = new IntVar(store,...A. M. GrubbSun, 16 Jul 2017 14:38:28 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#2908A. M. Grubb posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#ae46/cb90Yes when I run your code it works as expected. But I am using AndBool not AndBoolSimple. When I run a small varient of your code (see below) I get false. store = new Store(); IntVar L0 = new IntVar(store, "L0", 1, 100); IntVar TA0 = new IntVar(store, "TA0", 0, 0); IntVar[] links = new IntVar[2]; links[0] = new IntVar(store, "N0001_0_FS", 0, 0); links[1] = new IntVar(store, "N0002_0_FS", 0, 1); IntVar N0000_0_FS = new IntVar(store, "N0000_0_FS", 0, 0); store.impose(new IfThen( new XgtY(L0, TA0), new...A. M. GrubbSun, 16 Jul 2017 14:34:08 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#ae46/cb90Radoslaw Szymanek posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#f685Hi, Please use store.print to print all the constraints. It may give you a hint what bad constraints you added to the store that together with the constraints you have already shown may be causing a conflict and a failure. best, RadekRadoslaw SzymanekSat, 15 Jul 2017 18:54:19 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#f685kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#ae46Hi Alicia, I have tried your constraint example and it is satisifed. I used the following code. void ex() { store = new Store(); IntVar L0 = new IntVar(store, "L0", 1, 100); IntVar TA0 = new IntVar(store, "TA0", 0, 0); IntVar N0001_0_FS = new IntVar(store, "N0001_0_FS", 0, 0); IntVar N0002_0_FS = new IntVar(store, "N0002_0_FS", 0, 1); IntVar N0000_0_FS = new IntVar(store, "N0000_0_FS", 0, 0); store.impose(new IfThen( new XgtY(L0, TA0), new AndBoolSimple(N0001_0_FS, N0002_0_FS, N0000_0_FS))); boolean...krisSat, 15 Jul 2017 05:53:54 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#ae46A. M. Grubb modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#ab72Hi Radoslaw, I agree with everything you've written. The problem is that after I add this constraint to the store, store.consistency() returns false. Do you know any reason why store.consistency() would return false? Thanks, AliciaA. M. GrubbFri, 14 Jul 2017 20:49:50 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#ab72A. M. Grubb posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#ab72Hi Radoslaw, I agree with everything you've written. The problem is that after I add this constraint to the store, store.consistency() returns false. Do you know any reason why store.consistency() would returns false? Thanks, AliciaA. M. GrubbFri, 14 Jul 2017 20:49:22 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#ab72Radoslaw Szymanek posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#5e78Hi, XgtY1 : XgtY(L0::{1..100}, TA0 = 0 ) is a satisfied constraint because L0 is certain to be greater than TA0. andBoolSimple([ N0001_0_FS=0, N0002_0_FS::{0..1}], N0000_0_FS=0) is also a satisfied constraint as first argument is 0 and result is 0. The constraint can be satisfied even if result is equal 0. Both of the constraint are satisfied so IfThen should also be satisfied. The fact that N0000_0_FS=0 does not mean that constraint is not satisfied. It is satisfied because result is 0 and one of...Radoslaw SzymanekFri, 14 Jul 2017 20:28:16 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#5e78A. M. Grubb posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#e988I think I have a misunderstanding on how AndBool works (and by extension OrBool). AndBool(IntVar[] a, IntVar result) I think it works where AND(a1, a2, .. an) = result. Can I use it as the "then" component in a IfThen? If (L0 > TA0) Then (AND(a1, a2, .. an) = result) Just AndBool Gives me the results I expect: AndBoolSimple1 : andBoolSimple([ N0001_0_FS=0, N0002_0_FS::{0..1}], N0000_0_FS::{0..1}) AndBool as the result of Then results in conflicting constraints: IfThen1 : IfThen( XgtY1 : XgtY(L0::{1..100},...A. M. GrubbFri, 14 Jul 2017 18:59:03 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/231b275d/?limit=25#e988NicholasH posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#68f3/46ffYes it does, Thanks for your help! Kind regards, NicholasNicholasHThu, 23 Mar 2017 15:01:30 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#68f3/46ffkris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#68f3Your search in the included code searches for the first leagal solution and this...krisThu, 23 Mar 2017 14:57:02 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#68f3NicholasH posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#d20cFirst of all: Thank you for you help! Second: So once you get all solutions, you...NicholasHThu, 23 Mar 2017 14:49:54 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#d20cNicholasH modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#51a9Hello, I'm currently using JaCoP as a graph colorer (which works pretty great), but...NicholasHThu, 23 Mar 2017 14:46:44 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#51a9NicholasH modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#51a9Hello, I'm currently using JaCoP as a graph colorer (which works pretty great), but...NicholasHThu, 23 Mar 2017 14:46:16 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#51a9NicholasH modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#51a9Hello, I'm currently using JaCoP as a graph colorer (which works pretty great), but...NicholasHThu, 23 Mar 2017 14:45:35 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#51a9NicholasH modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#51a9Hello, I'm currently using JaCoP as a graph colorer (which works pretty great), but...NicholasHThu, 23 Mar 2017 14:45:06 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#51a9kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#594eHi! Your question basically addresses the problem of a solution iterator. No, it...krisThu, 23 Mar 2017 14:44:48 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#594eNicholasH posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#51a9Hello, I'm currently using JaCoP as a graph colorer (which works pretty great), but...NicholasHThu, 23 Mar 2017 14:41:33 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8dfe0f5a/?limit=25#51a9kris posted a comment on discussion Open Discussionhttps://sourceforge.net/p/jacop-solver/discussion/1220991/thread/c142ae9b/?limit=25#5e7eYou are right. The comments are incorrect. The first comment that states that it...krisThu, 23 Mar 2017 07:32:12 -0000https://sourceforge.net/p/jacop-solver/discussion/1220991/thread/c142ae9b/?limit=25#5e7eA. M. Grubb posted a comment on discussion Open Discussionhttps://sourceforge.net/p/jacop-solver/discussion/1220991/thread/c142ae9b/?limit=25#998fI think there is an error in the documentation for getSolution(int no). http://jacopapi.osolpro.com...A. M. GrubbWed, 22 Mar 2017 17:51:12 -0000https://sourceforge.net/p/jacop-solver/discussion/1220991/thread/c142ae9b/?limit=25#998fA. M. Grubb posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/17a45e6d/?limit=25#f48f"sat.debug = true;" should be sufficient for now. :) Thanks! AliciaA. M. GrubbWed, 15 Mar 2017 17:30:57 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/17a45e6d/?limit=25#f48fkris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/17a45e6d/?limit=25#fcc2I just checked the code and you can try to do the following. sat.debug = true; This...krisWed, 15 Mar 2017 14:58:11 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/17a45e6d/?limit=25#fcc2A. M. Grubb posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/17a45e6d/?limit=25#60e2/0ffbDid you implement a way to print out the single clause (presumably in CNF)? Thanks,...A. M. GrubbWed, 15 Mar 2017 14:52:39 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/17a45e6d/?limit=25#60e2/0ffbkris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/17a45e6d/?limit=25#60e2Hi! No, there is no way currently to print-out generated clauses to SAT solver. The...krisWed, 15 Mar 2017 14:40:37 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/17a45e6d/?limit=25#60e2A. M. Grubb posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/17a45e6d/?limit=25#264d/e614Hi Kris (or anyone), Is there a way to print out constraints imposed in the SatTranslation?...A. M. GrubbWed, 15 Mar 2017 14:29:29 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/17a45e6d/?limit=25#264d/e614kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/a56bba38/?limit=25#60d9No, it is not a bug. If you comment 'store.consistency();' JaCoP prints "No solution...krisTue, 21 Feb 2017 11:48:59 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/a56bba38/?limit=25#60d9JuhaTee posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/a56bba38/?limit=25#417dI run into a peculiar problem. Is it a bug or is a novice doing something wrong?...JuhaTeeTue, 21 Feb 2017 11:32:53 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/a56bba38/?limit=25#417dJuhaTee posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/a56bba38/?limit=25#569bWorks! Thanks! JuhaJuhaTeeTue, 21 Feb 2017 09:55:56 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/a56bba38/?limit=25#569bJuhaTee posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/a56bba38/?limit=25#e1dcThis helps. I'll try. Thanks! It is clear that wihout non-deterministic guesses propagation...JuhaTeeTue, 21 Feb 2017 09:42:12 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/a56bba38/?limit=25#e1dckris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/a56bba38/?limit=25#5f45Hi Juha! I see you are doing rather complex and non-standrad things. This requires...krisTue, 21 Feb 2017 08:59:55 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/a56bba38/?limit=25#5f45Juha Tiihonen posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/a56bba38/?limit=25#589dI want to propagate consequences of user decisions and examine feasible domains of...Juha TiihonenTue, 21 Feb 2017 08:29:20 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/a56bba38/?limit=25#589dkris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/60d17e07/?limit=25#13b7Hi! You can decompose the constraint as follows. store.impose(new XmodYeqZ(X, Y,...krisSat, 18 Feb 2017 10:03:19 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/60d17e07/?limit=25#13b7Radoslaw Szymanek posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/60d17e07/?limit=25#1387Hi, We divided the constraints into two types Primitive and non-primitive on purpose....Radoslaw SzymanekFri, 17 Feb 2017 17:09:00 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/60d17e07/?limit=25#1387Juha Tiihonen posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/60d17e07/?limit=25#2debI'm testing Jacop as a potential solver for an application in a technical domain....Juha TiihonenFri, 17 Feb 2017 15:59:45 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/60d17e07/?limit=25#2debJuha Tiihonen posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8c320541/?limit=25#6215Thanks. This works :-)Juha TiihonenFri, 17 Feb 2017 15:54:41 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8c320541/?limit=25#6215kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8c320541/?limit=25#afc0It is difficult to answer if I do not know your problem but I propose to make the...krisWed, 15 Feb 2017 15:27:30 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8c320541/?limit=25#afc0Juha Tiihonen posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8c320541/?limit=25#1361I have a similar need, but scaling does not work - the problems are mainly FD but...Juha TiihonenWed, 15 Feb 2017 15:21:05 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8c320541/?limit=25#1361kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8f94981b/?limit=25#4c69Hi! It might be that your problem is too difficult for JaCoP ;( Regarding floating-poiny...krisTue, 07 Feb 2017 06:55:29 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8f94981b/?limit=25#4c69Ricardo Gusmao posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8f94981b/?limit=25#0ced/450bHi Kris! Quick answer! Thanks in advance! I just tried both suggestions and here...Ricardo GusmaoTue, 07 Feb 2017 01:17:23 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8f94981b/?limit=25#0ced/450bkris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8f94981b/?limit=25#0cedHi! The best approach for SumFloat is to use LinearFloat. If you have the following...krisMon, 06 Feb 2017 07:46:33 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8f94981b/?limit=25#0cedRicardo Gusmao posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8f94981b/?limit=25#23d7Hi all. Have you ever need a "SumFloat" Constraint? I need this constraint for Float...Ricardo GusmaoMon, 06 Feb 2017 04:12:44 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/8f94981b/?limit=25#23d7Radoslaw Szymanek posted a comment on discussion Open Discussionhttps://sourceforge.net/p/jacop-solver/discussion/1220991/thread/d00be4fd/?limit=25#4ec5The assignment constraint was created with expectation that arrays of x and d are...Radoslaw SzymanekTue, 10 Jan 2017 16:26:26 -0000https://sourceforge.net/p/jacop-solver/discussion/1220991/thread/d00be4fd/?limit=25#4ec5kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/0f21a924/?limit=25#f1fcThe algorithm for labeling is DFS (Depth First Search). If you use cost function...krisWed, 21 Dec 2016 07:47:10 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/0f21a924/?limit=25#f1fcMaxat posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/0f21a924/?limit=25#f19bThanks Kris! And what is the algorithm used in search.labeling? Somehow "search.labeling"...MaxatWed, 21 Dec 2016 05:47:59 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/0f21a924/?limit=25#f19bkris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/0f21a924/?limit=25#86a5The algorithm follows the idea of the Algorithm 1 presented in @article{DBLP:journals/tcad/AbderrahmanCK99,...krisTue, 20 Dec 2016 07:39:28 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/0f21a924/?limit=25#86a5Maxat posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/0f21a924/?limit=25#eca8Hello, What is the name of the algorithm used by Optimize function? For ex.: DepthFirstSearch...MaxatMon, 19 Dec 2016 22:23:59 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/0f21a924/?limit=25#eca8kris posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#5c7eHi! Basically you should decmopose the equations into simpler constraints using additional...krisFri, 16 Dec 2016 09:46:04 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#5c7eMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: Equation | Condition...MaxatFri, 16 Dec 2016 01:51:50 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: Equation | Condition...MaxatThu, 15 Dec 2016 19:30:50 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: Equation | Condition...MaxatThu, 15 Dec 2016 19:30:41 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: Equation | Condition...MaxatThu, 15 Dec 2016 19:30:32 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: Equation | Condition...MaxatThu, 15 Dec 2016 19:30:20 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: Equation | Condition...MaxatThu, 15 Dec 2016 19:29:59 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: Equation | Condition...MaxatThu, 15 Dec 2016 19:29:49 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: Equation | Condition...MaxatThu, 15 Dec 2016 19:29:40 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: Equation | Condition...MaxatThu, 15 Dec 2016 19:29:27 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: Equation | Condition...MaxatThu, 15 Dec 2016 19:29:04 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: DPM(I,S)= Equation...MaxatThu, 15 Dec 2016 19:27:10 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: Equation | Condition...MaxatThu, 15 Dec 2016 19:26:22 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: DPM(I,S)= Equation...MaxatThu, 15 Dec 2016 19:25:16 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: DPM(I,S)= 123+213I+312hd(I,S)...MaxatThu, 15 Dec 2016 19:22:47 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: DPM(I,S)= 123+213I+312hd(I,S)...MaxatThu, 15 Dec 2016 19:22:27 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat modified a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: DPM(I,S)=( 123+213I+312hd(I,S)...MaxatThu, 15 Dec 2016 19:20:49 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deMaxat posted a comment on discussion Helphttps://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deHello, I am trying to represent following equation as constraints: 123+213I+312hd(I,S)...MaxatThu, 15 Dec 2016 19:16:59 -0000https://sourceforge.net/p/jacop-solver/discussion/1220992/thread/6269d243/?limit=25#e7deA. M. Grubb posted a comment on discussion Open Discussionhttps://sourceforge.net/p/jacop-solver/discussion/1220991/thread/e2157a85/?limit=25#bc26/d0a8Thank you!A. M. GrubbTue, 22 Nov 2016 13:29:10 -0000https://sourceforge.net/p/jacop-solver/discussion/1220991/thread/e2157a85/?limit=25#bc26/d0a8