Hi The program attached select a contiguous set of the values in an array. This contiguous values in array is like a window or frame over this array. I am doing this find the maximal of this subset in a array. The program is woking fine .... but it is halting for one solution per time. The minimize predicate should be exploring all the possibilities ... trying to minimize a cost function. Why the branch-bound is not working? To run it, press go. Thanks in advance and excuse for the code comments in Portugese -- Obrigado claudio ( )) |""|-. |__|-' ********************************************************************** http://claudiocesar.wordpress.com/about/ ***********************************************************************
This archive was generated by hypermail 2.2.0 : Sun Jun 30 2013 - 06:13:30 CEST