[gecode-users] Gecode/J arithmetic constraints

[penche21 penche21]

Hi there,

May be a  linear() constraint with coefficient [1,1] and array of [a,b]
linear (this, coeff, Array, IRT_EQ, varZ); could help.

-- There might be another way to express  (but I dont know)

Cheers,
penche

>From: Lars Frantzen <lars.frantzen at isti.cnr.it>
>To: users at gecode.org
>Subject: [gecode-users] Gecode/J arithmetic constraints
>Date: Mon, 02 Apr 2007 17:56:01 +0200
>
>Dear list,
>
>I am new to constraint solving, to Gecode, and to this list, and have a
>quite basic question (I guess). I am mainly interested in my Ph.D.
>project in solving arithmetic constraints. I saw that Gecode offers here
>beside others "plus", "minus" and "sqr".
>
>I cannot find those in Gecode/J. Do I miss something? I want to express
>a constraint like z = x + y (over finite domains).
>
>Thanks and cheers,
>Lars
>
>
>
>_______________________________________________
>Gecode users mailing list
>users at gecode.org
>https://www.gecode.org/mailman/listinfo/gecode-users

_________________________________________________________________
Hava durumunu bizden ögrenin ve evden öyle çikin! 
http://www.msn.com.tr/havadurumu/