[Help-glpk] [Fwd: Depth first search]

[Andrew Makhorin]

-------- Forwarded Message --------
From: Ralph Lorentzen <address@hidden>
To: address@hidden
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.)