[Cbc-tickets] [COIN-OR Branch-and-Cut MIP Solver] #172: Maximum Running Time for Infeasible Problem

[COIN-OR Branch-and-Cut MIP Solver]

#172: Maximum Running Time for Infeasible Problem
------------------------+-----------------
Reporter:  st688        |      Owner:  tkr
    Type:  enhancement  |     Status:  new
Priority:  minor        |  Component:  Cbc
 Version:  2.9.2        |   Keywords:
------------------------+-----------------
 Hello,

 I used CbcModel::setMaximumSeconds to set the maximum running time
 (5-mins) for solving an MILP. When the MILP is feasible (or a feasible
 solution can be found within the maximum seconds, I guess), the problem
 can be solved within that running time. However, when the MILP is
 infeasible, the solver will not return until it determined that the
 program is infeasible, which takes much longer time than what I wanted. I
 wonder if there is any option to force the branch and bound solver to
 return upon the timeout, so that I would be able to take further action
 with respect to the best possible result.

 Thank you.

--
Ticket URL: <https://projects.coin-or.org/Cbc/ticket/172>
COIN-OR Branch-and-Cut MIP Solver <http://projects.coin-or.org/Cbc>
An LP-based branch-and-cut MIP solver.