Ah okay,
But this is just a four dimensional array of decision variables, so that's no problem of course. The easiest way to do it in Gecode is to map the four dimensional array to a simple one-dimensional array (a simple access function the does the index computation will do). Best Christian -- Christian Schulte, Professor of Computer Science, KTH, www.ict.kth.se/~cschulte/ From: Amin Alah Mousavi Nogholi [mailto:a.mousavinogh...@qut.edu.au] Sent: Monday, September 02, 2013 11:11 AM To: cschu...@kth.se Subject: RE: [gecode-users] large Instance Thanks Christian, X[i][m][d][t] is such a 4 dimensional decision variable where I,m,d and t have finite domain (e.g. i=1,2,.,10000; m=1,..,10; d=1,.10; t=1,.,50;) Regards, Amin From: Christian Schulte [mailto:cschu...@kth.se] Sent: Monday, 2 September 2013 7:05 PM To: Amin Alah Mousavi Nogholi; users@gecode.org Subject: RE: [gecode-users] large Instance Hi, Almost impossible to say whether this will work or not. Gecode can use recomputation to bring down memory requirements during search at the expensive of increased runtime. One would have to try. I have no idea what a 4 dimensional decision variable is. Best Christian -- Christian Schulte, Professor of Computer Science, KTH, www.ict.kth.se/~cschulte/ From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf Of Amin Alah Mousavi Nogholi Sent: Monday, September 02, 2013 2:31 AM To: users@gecode.org Subject: [gecode-users] large Instance Hi, I need to solve a problem with millions of decision variables and constraints. I could not solve this problem by CPlex Cp optimiser. I am just wondering that Gecode can solve or not? Does anybody has such an instance? The second question is that I have a 4-dimensional decision variable. Can Gecode handle this decision variable. Thanks in advance, Amin
_______________________________________________ Gecode users mailing list users@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
