[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        |  Resolution:
Keywords:               |
------------------------+------------------

Comment (by andrewwald):

 Hi st688,

 I've copied this issue to the project repository here:
 https://github.com/coin-or/Cbc/issues/38

 Thanks,
 Andrew

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