[gecode-users] Does Gecode compile to constraint-free code?

[Christian Schulte]

Why think about premature optimization? Gecode is pretty efficient and your
problems are trivial. So I first would try it without further thinking about
optimization.

Best
Christian

--
Christian Schulte, www.ict.kth.se/~cschulte/



-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Maik Riechert
Sent: Tuesday, August 28, 2012 10:32 AM
To: cschulte at kth.se
Cc: users at gecode.org
Subject: Re: [gecode-users] Does Gecode compile to constraint-free code?

> I am not sure that I get your question.

I also just asked it on StackOverflow, maybe it makes it more clear:

http://stackoverflow.com/questions/12155312/deriving-equations-for-finite-do
main-constraint-system

> For realistic constraints such as
> those available in Gecode this is not really possible. Warwick's paper 
> talks about a slightly different setup (solving very simple [linear] 
> constraints repeatedly).

I think this is exactly what I'm doing, solving very simple linear finite
domain constraints repeatedly. So, you say that Gecode's main use case is
solving very big constraint systems few times / once, right?

Regards
Maik

_______________________________________________
Gecode users mailing list
users at gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users