Hello, If B&C search gets interrupted due to time-out and but then is run again, does it start from scratch or is it able to continue from where it stopped? Is there a way for it to store all the internal data structures and continue?
Basically I want GLPK MIP solver to give me the first "acceptable" solution because sometimes it spends a lot of time searching "near" the optimal one (as far as I see in the output). I guess the easiest would be to use the callback function but this seems problematic since I'm invoking GLPK via JNI (by using SWIG wrapper classes). Therefore I set a time limit and then check if some solution has been found. If not, I'd like to continue the search. Thanks, Pavel -- cheers, --pavel http://www.cs.man.ac.uk/~klinovp _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
