Build (method = -2) #dp: 7255 Step-3' Graph: 103 vertices and 298 arcs (0.03s) Step-4' Graph: 13 vertices and 118 arcs (0.03s) #V4/#V3 = 0.13 #A4/#A3 = 0.40 Ready! (0.03s) Optimize a model with 32 rows, 119 columns and 339 nonzeros Presolve removed 4 rows and 6 columns Presolve time: 0.00s Presolved: 28 rows, 113 columns, 328 nonzeros Variable types: 0 continuous, 113 integer (15 binary) Found heuristic solution: objective 196.0000000 Found heuristic solution: objective 124.0000000 Optimize a model with 28 rows, 113 columns and 328 nonzeros Presolved: 28 rows, 113 columns, 328 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.220e+02 Factor NZ : 3.300e+02 Factor Ops : 5.130e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.50816535e+02 -1.24997717e+03 3.05e+02 4.83e-02 3.52e+01 0s 1 1.94582376e+02 -6.41325682e+02 1.82e+01 4.44e-16 4.78e+00 0s 2 8.84966202e+01 -3.61533478e+01 7.82e-14 4.44e-16 5.20e-01 0s 3 4.31748666e+01 2.53795282e+01 4.62e-14 3.89e-16 7.36e-02 0s 4 4.04632720e+01 3.91369705e+01 3.44e-14 6.66e-16 5.48e-03 0s 5 4.00022484e+01 3.99914459e+01 2.86e-14 3.33e-16 4.46e-05 0s 6 4.00000000e+01 4.00000000e+01 3.14e-14 4.44e-16 6.30e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 98 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 40.0000000 40.00000 0.0% - 0s Explored 0 nodes (98 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.000000000000e+01, best bound 4.000000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.00 seconds Total run time: 0.05 seconds Objective: 40 Solution: 14 x [2, 4, 14, 17, 19] 7 x [1, 2, 6, 7, 8] 2 x [6, 13, 14, 16, 18] 9 x [3, 11, 13, 16, 16] 1 x [1, 7, 8, 10, 13] 3 x [3, 4, 8, 13, 14] 2 x [8, 12, 13, 15, 18] 1 x [8, 9, 12, 18, 19] 1 x [5, 8, 12, 17, 19]