Re: [Help-glpk] Using a heuristic to find a first integer solution quickly

[Andrew Makhorin]

>I have a similar problem, GLPK takes too much time to find the first
>integer feasible solution, but i have a heuristic able to find a
>sub-optimal integer feasible solution in a short time.
>How can I use it?
>Isn't there a simpler method than changing the source of the branch and
>bound solver?

A simpler method must appear in glpk 3.3 :+)

In glpk 3.2.3 you can insert two statements between lines 634 and 635 in
the file glplpx6c.c as follows:

633:  /* reset the status of the mip solution */
634:  mip->i_stat = LPX_I_UNDEF;
      tree->found = 1;
      tree->best[0] = <objective value from a heuristic>;
635:  /* solve the problem */
636:  ret = mip_driver(tree);