-------- Forwarded Message -------- From: Ralph Lorentzen <[email protected]> To: [email protected] Subject: Depth first search Date: Thu, 21 Apr 2011 11:27:36 +0200
In order to get a feasible integer solution fast I use depth first search. Since I have constraints of the type Sum_i (x_i) = 1, x_i >= 0, I would like to branch up in the search. Does GLPK always branch down in the depth first search? (In that case I can replace variable x_i by 1 - x_i in order to simulate a branch up in the depth first search.) _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
