Hi mr. Makhorin, thank you for the fast answer. Well, there is any way to obtain the entire list of nodes and build the tree? Is possible to modify the B&C api's to obtain that list?
Kind Regards, IG 2010/2/24 Andrew Makhorin <[email protected]> > > Not in this problem but in other problems i have wrong node list, i > > have that some current nodes have more than 1 up node and that is > > wrong, and some up nodes have more than 2 "children". > > > What I #39;m doing wrong? > > You make *wrong* assumption that the subproblem reference number > returned by glp_ios_curr/up/next/prev_node uniquely identifies the > corresponding node of the search tree. The reference number assigned > to a subproblem is valid only while its node exists in the tree. Once > the subproblem has been fathomed, its node is removed from the tree, > in which case the corresponding reference number is freed and can be > assigned to any other new subproblem appearing in the tree. > > > >
_______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
