I have been using the GLPK software on some programs with heuristics
for MIP. I fix some integer variables with the heuristics, and
determine the remaining and the continuous ones with lpx_integer (I
have put a tabu search software based in this approach on
http://www.ncc.up.pt/~jpp/mipts).
Sorry, I did not mention the context of this use of record_solution; I
was writing a version to call after fixing some integer variables with
some heuristics, and doing a branch-and-bound on the remaining. So it
seems that I need to use lpx_get_mip_val, and also lpx_mip_col_val and
I am writing a version of the record_solution function, defined in
glpmip2.c, and I got confused; shouldn't the line
tree-best = lpx_get_obj_val(lp);
be replaced by
tree-best = lpx_get_mip_val(lp);
as we are dealing with MIPs?
The correct line is the following:
tree-best
