<br><font size=2 face="sans-serif">I agree with adding in a feasibility
checker which has as input where it is being called from. However
to complicate matters there are at present three places in CBC where a
solution can be found-</font>
<br>
<br><font size=2 face="sans-serif">1) In normal branching - this is the
situation which has been discussed.</font>
<br><font size=2 face="sans-serif">2) As a by product of strong branching.
</font>
<br><font size=2 face="sans-serif">3) As the result of a heuristic. I
think it is still worth having a final check so that users can pick up
other peoples heuristics.</font>
<br>
<br><font size=2 face="sans-serif">So I would propose 4 input states (2
for case 1).</font>
<br>
<br><font size=2 face="sans-serif">Output would be 0 - continue</font>
<br><font size=2 face="sans-serif"> 1 accept as valid integer solution</font>
<br><font size=2 face="sans-serif"> 2 treat as an infeasible
node (not for heuristic call)</font>
<br><font size=2 face="sans-serif"> 3 exit from while loop
(not for heuristic or strong branching calls)</font>
<br>
<br><font size=2 face="sans-serif">Would that be close to what people want?</font>
<br>
<br><font size=2 face="sans-serif">John Forrest</font>