Build (method = -2) #dp: 11357 Step-3' Graph: 306 vertices and 1170 arcs (0.08s) Step-4' Graph: 174 vertices and 911 arcs (0.08s) #V4/#V3 = 0.57 #A4/#A3 = 0.78 Ready! (0.08s) Optimize a model with 202 rows, 912 columns and 2388 nonzeros Presolve removed 40 rows and 75 columns Presolve time: 0.01s Presolved: 162 rows, 837 columns, 2275 nonzeros Variable types: 0 continuous, 837 integer (216 binary) Found heuristic solution: objective 34.0000000 Found heuristic solution: objective 31.0000000 Found heuristic solution: objective 30.0000000 Optimize a model with 162 rows, 837 columns and 2275 nonzeros Presolved: 162 rows, 837 columns, 2275 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.379e+03 Factor NZ : 3.380e+03 Factor Ops : 9.090e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.75473114e+03 -4.76862089e+03 9.20e+03 1.86e-01 4.17e+01 0s 1 4.43105853e+02 -2.26372303e+03 1.97e+03 2.00e-15 9.18e+00 0s 2 8.10317087e+01 -9.18595803e+02 1.78e+02 1.89e-15 1.21e+00 0s 3 4.50190588e+01 -2.16754696e+02 1.50e+01 2.00e-15 1.87e-01 0s 4 2.80719331e+01 -4.72376154e+01 1.51e+00 2.22e-15 4.64e-02 0s 5 1.34266216e+01 -1.92410988e+01 4.23e-01 2.10e-15 1.97e-02 0s 6 8.76407600e+00 -3.60290763e+00 2.12e-01 2.67e-15 7.44e-03 0s 7 7.26897706e+00 9.80157998e-01 1.15e-01 1.67e-15 3.77e-03 0s 8 6.99600215e+00 4.03003099e+00 6.04e-02 2.25e-15 1.77e-03 0s 9 6.29508483e+00 6.03083606e+00 1.95e-03 2.14e-15 1.57e-04 0s 10 6.25015525e+00 6.24965196e+00 9.55e-15 2.27e-15 2.98e-07 0s 11 6.25000016e+00 6.24999965e+00 1.74e-14 2.39e-15 2.98e-10 0s 12 6.25000000e+00 6.25000000e+00 6.64e-15 2.56e-15 2.98e-13 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 6.25000000e+00 Root relaxation: objective 6.250000e+00, 570 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 6.25000 0 13 30.00000 6.25000 79.2% - 0s H 0 0 7.0000000 6.25000 10.7% - 0s Explored 0 nodes (983 simplex iterations) in 0.05 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.000000000000e+00, best bound 7.000000000000e+00, gap 0.0% Preprocessing time: 0.09 seconds Gurobi run time: 0.05 seconds Total run time: 0.15 seconds Objective: 7 Solution: 1 x [3, 4, 5, 6, 11, 20, 26] 1 x [3, 6, 11, 12, 17, 18, 19, 23] 1 x [1, 1, 2, 4, 15, 27, 27, 28] 1 x [12, 15, 21, 22, 24, 25] 1 x [7, 10, 10, 12, 21, 22, 24, 25] 1 x [8, 9, 9, 9, 10, 15, 20] 1 x [9, 13, 14, 16, 16, 16]