Like for NP problems this depends on the problem itself. But given you have so many variables and call them "decision variables" i would guess that most of them are boolean? If this is the case you could try an encoding in SAT or ASP (Answer Set Programming) where solvers are capable of handling such large numbers of variables.
Best Max On 09/02/2013 02:30 AM, Amin Alah Mousavi Nogholi wrote: > > 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
_______________________________________________ Gecode users mailing list users@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
