Build (method = -2) #dp: 2753 Step-3' Graph: 138 vertices and 406 arcs (0.02s) Step-4' Graph: 19 vertices and 168 arcs (0.02s) #V4/#V3 = 0.14 #A4/#A3 = 0.41 Ready! (0.02s) Optimize a model with 60 rows, 169 columns and 474 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 58 rows, 167 columns, 470 nonzeros Variable types: 0 continuous, 167 integer (27 binary) Found heuristic solution: objective 58.0000000 Optimize a model with 58 rows, 167 columns and 470 nonzeros Presolved: 58 rows, 167 columns, 470 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.820e+02 Factor NZ : 6.450e+02 Factor Ops : 1.197e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.35936249e+02 -3.49544288e+02 8.37e+01 4.26e-02 4.65e+00 0s 1 7.64991952e+01 -1.32144104e+02 1.63e-13 2.22e-16 5.88e-01 0s 2 4.02461568e+01 1.57798194e+01 5.68e-14 2.22e-16 6.73e-02 0s 3 3.34119791e+01 3.29062232e+01 4.76e-14 1.11e-16 1.38e-03 0s 4 3.33334132e+01 3.33329074e+01 6.95e-14 1.11e-16 1.38e-06 0s 5 3.33333333e+01 3.33333333e+01 6.72e-14 1.11e-16 1.38e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 123 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 33.33333 0 4 58.00000 33.33333 42.5% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (142 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.400000000000e+01, best bound 3.400000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.01 seconds Total run time: 0.04 seconds Objective: 34 Solution: 3 x [34, 38, 41] 1 x [29, 38, 40] 1 x [31, 34, 39] 1 x [32, 34, 38] 2 x [27, 36, 37] 1 x [28, 33, 37] 1 x [21, 24, 35] 1 x [3, 6, 31] 3 x [17, 25, 30] 1 x [11, 13, 29] 1 x [19, 22, 28] 2 x [1, 2, 26] 2 x [3, 5, 23] 2 x [16, 19, 22] 3 x [10, 13, 21] 2 x [11, 18, 20] 1 x [14, 18, 18] 1 x [8, 15, 16] 2 x [4, 9, 12] 2 x [4, 7, 11] 1 x [6]