Build (method = -2) #dp: 8117 Step-3' Graph: 115 vertices and 336 arcs (0.04s) Step-4' Graph: 22 vertices and 150 arcs (0.04s) #V4/#V3 = 0.19 #A4/#A3 = 0.45 Ready! (0.04s) Optimize a model with 39 rows, 151 columns and 415 nonzeros Presolve removed 9 rows and 16 columns Presolve time: 0.00s Presolved: 30 rows, 135 columns, 386 nonzeros Variable types: 0 continuous, 135 integer (0 binary) Found heuristic solution: objective 196.0000000 Found heuristic solution: objective 126.0000000 Optimize a model with 30 rows, 135 columns and 386 nonzeros Presolved: 30 rows, 135 columns, 386 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.490e+02 Factor NZ : 3.220e+02 Factor Ops : 4.404e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.43190188e+02 -1.93625113e+03 3.47e+02 2.22e-16 3.06e+01 0s 1 2.18343777e+02 -7.23043807e+02 1.57e+01 3.33e-16 4.11e+00 0s 2 8.55030959e+01 -5.69253707e+01 1.05e-03 4.44e-16 5.03e-01 0s 3 3.66596954e+01 2.66664952e+00 3.43e-05 2.22e-16 1.19e-01 0s 4 3.39067593e+01 3.15298171e+01 4.53e-06 2.36e-16 8.28e-03 0s 5 3.34063202e+01 3.32424609e+01 3.91e-08 2.22e-16 5.71e-04 0s 6 3.33334104e+01 3.33327113e+01 3.45e-10 4.44e-16 2.44e-06 0s 7 3.33333333e+01 3.33333333e+01 6.01e-13 2.22e-16 2.47e-12 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 110 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 7 126.00000 33.33333 73.5% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (130 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.05 seconds Gurobi run time: 0.01 seconds Total run time: 0.05 seconds Objective: 34 Solution: 12 x [3, 5, 6, 11, 12, 16] 2 x [2, 8, 11, 13, 13, 16] 4 x [4, 10, 12, 13, 13, 17] 1 x [3, 3, 8, 10, 12, 15] 1 x [2, 4, 8, 10, 17] 3 x [1, 3, 9, 13, 13, 14] 1 x [1, 5, 8, 10, 13, 17] 9 x [7, 8, 9, 13, 13, 14] 1 x [13, 14, 15]