[Bonmin] Could you help me look at the problem,Thanks!

[Stefan Vigerske]

Hi,

corresponding to the two lines

> Cbc0013I At root node, 0 cuts changed objective from 176.001 to  
> 176.001 in 1 passes
> [...]
> OA0003I New best feasible of 176.007 found after 0.203 sec.
> Cbc0016I Integer solution of 176.007 found by strong branching after 0  
> iterations and 0
> nodes (0.19 seconds)

I would think that the algorithm finished because the gap was closed.
Lower bound was (at least) 176.001, upper bound, i.e., incumbent
solution, is 176.007.

Best,
Stefan