Hi,
I am still not sure what you are referring to but I am guessing it is about best solution search (Branch-and-bound). This does not work by starting from and improving a feasible solution. Maybe you would like to make yourself comfortable with the idea of best solution search in constraint programming. Best Christian -- Christian Schulte, www.ict.kth.se/~cschulte/ From: [email protected] [mailto:[email protected]] On Behalf Of Aribi Noureddine Sent: Monday, December 03, 2012 8:35 PM To: [email protected] Cc: [email protected] Subject: Re: [gecode-users] [search engine] Set a starting point ! Hi, I mean by the starting point a feasible solution (not necessarily the best) that I want to improve. Best reagrds, _ _ _ Noureddine ARIBI _____ De : Christian Schulte <[email protected]> À : 'Aribi Noureddine' <[email protected]>; [email protected] Envoyé le : Lundi 3 décembre 2012 20h08 Objet : RE: [gecode-users] [search engine] Set a starting point ! Hi, What do you mean by a starting point? Christian -- Christian Schulte, www.ict.kth.se/~cschulte/ From: [email protected] [mailto:[email protected]] On Behalf Of Aribi Noureddine Sent: Monday, December 03, 2012 5:10 PM To: [email protected] Subject: [gecode-users] [search engine] Set a starting point ! Hi all, Is there a way to let the search engine explore the search space from a starting point? Thank you. Best regards, _ _ _ Noureddine ARIBI
_______________________________________________ Gecode users mailing list [email protected] https://www.gecode.org/mailman/listinfo/gecode-users
