I'm trying to implement LDS in Shaw (1998) for my routing problem. I developed the algorithm form my own problem, and debugged it many times. It seems to be correct, however, it returns "No feasible solution found" all the time. I'm sure my variable and value selection algorithms are not the problem since I debugged them as well, and also replacing them with other things like: IlcInt var = IlcChooseMinSizeInt(x); IlcInt val = x[var].getMin(); returns the same result!
I've been thinking about every little thing for very long, however, came up with nothing. Would you please let me know how I could resolve this, or if you've had such an experience using ILOGOAL?