Build (method = -2) #dp: 2084 Step-3' Graph: 332 vertices and 989 arcs (0.01s) Step-4' Graph: 200 vertices and 725 arcs (0.02s) #V4/#V3 = 0.60 #A4/#A3 = 0.73 Ready! (0.02s) Optimize a model with 220 rows, 726 columns and 1782 nonzeros Presolve removed 20 rows and 34 columns Presolve time: 0.01s Presolved: 200 rows, 692 columns, 1751 nonzeros Variable types: 0 continuous, 692 integer (0 binary) Found heuristic solution: objective 149.0000000 Optimize a model with 200 rows, 692 columns and 1751 nonzeros Presolved: 200 rows, 692 columns, 1751 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.271e+03 Factor NZ : 5.340e+03 Factor Ops : 1.872e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.90272555e+03 -1.94522909e+04 2.37e+04 2.22e-16 9.64e+01 0s 1 6.45387229e+02 -9.54699286e+03 4.08e+03 1.78e-15 1.92e+01 0s 2 2.73677346e+02 -3.08221234e+03 5.84e+02 1.22e-15 3.75e+00 0s 3 1.78052195e+02 -4.41073498e+02 6.23e+01 1.11e-15 5.39e-01 0s 4 1.36935421e+02 -1.91730904e+02 7.77e+00 9.55e-16 2.42e-01 0s 5 1.16193876e+02 -1.12313000e+02 5.38e+00 1.25e-15 1.68e-01 0s 6 9.64464276e+01 -3.68019287e+01 3.42e+00 9.34e-16 9.75e-02 0s 7 8.54705896e+01 1.32979365e+01 2.07e+00 1.16e-15 5.26e-02 0s 8 7.66097036e+01 4.24747643e+01 9.30e-01 9.71e-16 2.47e-02 0s 9 7.51145604e+01 6.37358134e+01 4.85e-01 1.02e-15 8.25e-03 0s 10 7.19265183e+01 6.79466355e+01 1.46e-01 1.20e-15 2.87e-03 0s 11 7.11061567e+01 6.96372143e+01 5.75e-02 9.99e-16 1.06e-03 0s 12 7.06179715e+01 7.03516177e+01 6.24e-03 8.06e-16 1.91e-04 0s 13 7.05536884e+01 7.05242146e+01 2.85e-04 1.36e-15 2.11e-05 0s 14 7.05500063e+01 7.05499719e+01 1.07e-13 9.70e-16 2.45e-08 0s 15 7.05500000e+01 7.05500000e+01 7.11e-14 1.01e-15 2.47e-14 0s Barrier solved model in 15 iterations and 0.02 seconds Optimal objective 7.05500000e+01 Root relaxation: objective 7.055000e+01, 233 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 70.55000 0 64 149.00000 70.55000 52.7% - 0s H 0 0 74.0000000 70.55000 4.66% - 0s H 0 0 71.0000000 70.55000 0.63% - 0s Explored 0 nodes (547 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.100000000000e+01, best bound 7.100000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.06 seconds Total run time: 0.09 seconds Objective: 71 Solution: 6 x [2, 3, 5, 18] 4 x [2, 6, 9, 11, 13, 16, 20] 4 x [2, 4, 14, 17] 1 x [1, 2, 13, 14, 17] 1 x [2, 5, 11, 14, 17] 2 x [2, 5, 14, 16, 17] 1 x [1, 2, 3, 13, 20] 1 x [2, 3, 13, 15, 16, 20] 11 x [6, 9, 12, 13, 14] 2 x [5, 6, 8, 14] 2 x [3, 4, 6, 8, 13] 5 x [1, 3, 6, 8, 20] 6 x [6, 7, 9, 11, 15, 16] 3 x [3, 5, 6, 9, 13, 15, 17] 10 x [1, 5, 7, 10, 11] 4 x [5, 8, 11, 12, 19] 8 x [8, 9, 11, 14, 15, 16]