Build (method = -2) #dp: 3254 Step-3' Graph: 171 vertices and 986 arcs (0.02s) Step-4' Graph: 82 vertices and 808 arcs (0.02s) #V4/#V3 = 0.48 #A4/#A3 = 0.82 Ready! (0.02s) Optimize a model with 142 rows, 809 columns and 2267 nonzeros Presolve removed 24 rows and 24 columns Presolve time: 0.02s Presolved: 118 rows, 785 columns, 2240 nonzeros Variable types: 0 continuous, 785 integer (675 binary) Found heuristic solution: objective 37.0000000 Optimize a model with 118 rows, 785 columns and 2240 nonzeros Presolved: 118 rows, 785 columns, 2240 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.125e+03 Factor NZ : 3.108e+03 Factor Ops : 1.020e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.18405819e+03 -3.44313050e+03 3.92e+03 2.60e-01 1.65e+01 0s 1 4.63825674e+02 -9.26798682e+02 6.33e+02 5.55e-16 2.79e+00 0s 2 8.47439536e+01 -1.83527919e+02 6.94e+01 8.88e-16 3.63e-01 0s 3 3.25768298e+01 -2.04756446e+01 6.06e+00 4.44e-16 4.82e-02 0s 4 2.49165233e+01 4.12075641e+00 1.74e-01 1.33e-15 1.35e-02 0s 5 2.24511052e+01 1.57072763e+01 4.63e-02 6.66e-16 4.33e-03 0s 6 2.08442786e+01 1.71306190e+01 5.38e-03 4.44e-16 2.37e-03 0s 7 2.03643063e+01 1.89375397e+01 1.39e-03 4.44e-16 9.09e-04 0s 8 2.01586225e+01 1.96164776e+01 3.87e-04 4.44e-16 3.45e-04 0s 9 2.00948913e+01 1.98178322e+01 1.95e-04 4.44e-16 1.77e-04 0s 10 2.00613144e+01 1.99462395e+01 1.08e-04 1.33e-15 7.33e-05 0s 11 2.00107960e+01 1.99876960e+01 5.20e-06 4.44e-16 1.47e-05 0s 12 2.00012119e+01 1.99989635e+01 2.70e-07 4.44e-16 1.43e-06 0s 13 2.00000066e+01 1.99999956e+01 3.74e-10 1.33e-15 7.00e-09 0s 14 2.00000000e+01 2.00000000e+01 3.98e-13 4.44e-16 9.56e-15 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 57 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 20.0000000 20.00000 0.0% - 0s Explored 0 nodes (57 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 20 Solution: 1 x [43, 44, 45] 1 x [4, 5, 6] 1 x [34, 36, 47] 1 x [12, 55, 56] 1 x [33, 37, 38] 1 x [20, 40, 42] 1 x [25, 26, 27] 1 x [7, 8, 9] 1 x [13, 14, 15] 1 x [2, 31, 39] 1 x [1, 3, 32] 1 x [22, 23, 57] 1 x [10, 11, 24] 1 x [29, 52, 54] 1 x [58, 59, 60] 1 x [28, 30, 53] 1 x [16, 17, 18] 1 x [19, 21, 41] 1 x [49, 50, 51] 1 x [35, 46, 48]