Log started (V12.5.0.0) Sat Mar 09 11:26:42 2013
Problem 'f.sav' read.
Read time = 0.02 sec. (0.06 ticks)
Tried aggregator 3 times.
MIP Presolve eliminated 664 rows and 135 columns.
MIP Presolve modified 720 coefficients.
Aggregator did 188 substitutions.
Reduced MIP has 1793 rows, 681 columns, and 5432 nonzeros.
Reduced MIP has 402 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (7.76 ticks)
Probing fixed 50 vars, tightened 73 bounds.
Probing changed sense of 9 constraints.
Probing time = 0.02 sec. (2.76 ticks)
Cover probing fixed 0 vars, tightened 18 bounds.
Tried aggregator 2 times.
MIP Presolve eliminated 298 rows and 107 columns.
MIP Presolve modified 127 coefficients.
Aggregator did 34 substitutions.
Reduced MIP has 1460 rows, 540 columns, and 4425 nonzeros.
Reduced MIP has 298 binaries, 1 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.01 sec. (6.39 ticks)
Probing fixed 18 vars, tightened 51 bounds.
Probing time = 0.00 sec. (1.86 ticks)
Cover probing fixed 0 vars, tightened 21 bounds.
Clique table members: 1239.
Tightened 12 constraints.
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 4 threads.
Root relaxation solution time = 0.03 sec. (13.89 ticks)
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
0 0 30.0000 129 30.0000 533
0 0 30.0000 17 Cuts: 18 559
0 0 30.0000 3 Cuts: 10 580
* 0+ 0 30.0000 30.0000 580 0.00%
* 0+ 0 29.0000 30.0000 580 -3.45%
0 0 cutoff 29.0000 30.0000 580 -3.45%
Elapsed time = 0.19 sec. (83.34 ticks, tree = 0.00 MB, solutions = 2)
Clique cuts applied: 11
Implied bound cuts applied: 3
Flow cuts applied: 1
Mixed integer rounding cuts applied: 4
Gomory fractional cuts applied: 3
Root node processing (before b&c):
Real time = 0.16 sec. (62.38 ticks)
Parallel b&c, 4 threads:
Real time = 0.00 sec. (0.00 ticks)
Sync time (average) = 0.00 sec.
Wait time (average) = 0.00 sec.
------------
Total (root+branch&cut) = 0.16 sec. (62.38 ticks)
Solution pool: 2 solutions saved.
MIP - Integer optimal solution: Objective = 2.9000000000e+001
Solution time = 0.20 sec. Iterations = 580 Nodes = 0
Deterministic time = 83.39 ticks (412.83 ticks/sec)
83.39 ticks (412.83 ti