Best solution search is independent of branching. Instead, the model must
have a method
void constrain(Space* s) { ... }
which implements the objective function as follows: The space on which the
method is run (this) must be constrained with respect to the so-far best
solution passed as argument s.
For examples, please see golomb-ruler, photo, tsp, ... in the example
subdirectory.
Christian
--
Christian Schulte, www.ict.kth.se/~cschulte/
-----Original Message-----
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf
Of Dhananjay Thiruvady
Sent: Friday, April 11, 2008 4:00 AM
To: [EMAIL PROTECTED]
Subject: [gecode-users] Branching question
Hi,
I want to know how I could use branch with minimization of an objective
function?
Thanks,
Dhananjay
_______________________________________________
Gecode users mailing list
[EMAIL PROTECTED]
https://www.gecode.org/mailman/listinfo/gecode-users
_______________________________________________
Gecode users mailing list
[EMAIL PROTECTED]
https://www.gecode.org/mailman/listinfo/gecode-users
