Build (method = -2) #dp: 1546 Step-3' Graph: 102 vertices and 297 arcs (0.01s) Step-4' Graph: 15 vertices and 123 arcs (0.01s) #V4/#V3 = 0.15 #A4/#A3 = 0.41 Ready! (0.01s) Optimize a model with 45 rows, 124 columns and 348 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 43 rows, 122 columns, 344 nonzeros Variable types: 0 continuous, 122 integer (48 binary) Found heuristic solution: objective 33.0000000 Optimize a model with 43 rows, 122 columns and 344 nonzeros Presolved: 43 rows, 122 columns, 344 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.330e+02 Factor NZ : 4.060e+02 Factor Ops : 5.894e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.11240376e+02 -1.34437478e+02 2.62e+01 3.65e-02 1.94e+00 0s 1 2.73976870e+01 -4.28678956e+01 7.46e-14 2.22e-16 2.83e-01 0s 2 1.73916848e+01 1.23739266e+01 1.71e-14 3.33e-16 1.96e-02 0s 3 1.66878548e+01 1.66495157e+01 1.19e-14 5.52e-17 1.49e-04 0s 4 1.66666879e+01 1.66666495e+01 9.70e-15 2.72e-16 1.49e-07 0s 5 1.66666667e+01 1.66666667e+01 1.20e-13 2.22e-16 1.52e-13 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.66666667e+01 Root relaxation: objective 1.666667e+01, 87 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 16.66667 0 3 33.00000 16.66667 49.5% - 0s H 0 0 17.0000000 16.66667 1.96% - 0s Explored 0 nodes (118 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.700000000000e+01, best bound 1.700000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.01 seconds Total run time: 0.03 seconds Objective: 17 Solution: 3 x [2, 4, 13] 1 x [1, 3, 22] 1 x [24, 27, 30] 2 x [3, 23, 29] 1 x [10, 10, 28] 2 x [6, 20, 26] 1 x [18, 21, 25] 1 x [3, 22] 2 x [11, 15, 19] 1 x [9, 16, 17] 1 x [5, 8, 14] 1 x [3, 7, 12]