AnsweredAssumed Answered

Implementing Lazy Constraints (Java)

Question asked by on Jun 21, 2016
Latest reply on Jun 23, 2016 by Susanne.Heip

We are interested in using Lazy Constraints in Xpress (Java) to implement a TSP algorithm. In particular, after each integer solution is generated, we would like to search for violated constraints and add the needed cuts if necessary.  We have tried to use the XPRSpreIntsolListener callback, but keep getting jre memory access error messages.  Any help, especially actual code, on how to do this would be greatly appreciated.