Hello, I need to perform the act in the subject "Updating lower bound - of a minimization problem- during search" in my algorithm. Specifically, when all variables are instantiated (i mean, at a leaf node), i want to develop a new solution from it heuristically and update the upper bound of the problem. I am an ILOG user and couldn't achieve the relevant update. I have read the user manuel of Eclipse's last release but I am not sure if I can do what I want. I appreciate if you can help me on this subject. Best, İstençReceived on Fri Jan 18 2019 - 14:44:37 CET
This archive was generated by hypermail 2.3.0 : Wed Sep 25 2024 - 15:13:21 CEST