Hi, With the GLPK package I have received very good documentation on the Implementation of the Revised Simplex Method. Is it possible to receive the same kind of documentation on the implementation of the branch-and-bound method? For exemple I try to understand how the algorithm stop. Does is stop when we have find the optimal solution, or after x iterations, or if we are at x% of the optimal solution???
Thanks in advance. Marc-Antoine _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
