Build (method = -2) #dp: 6786 Step-3' Graph: 106 vertices and 307 arcs (0.03s) Step-4' Graph: 16 vertices and 127 arcs (0.03s) #V4/#V3 = 0.15 #A4/#A3 = 0.41 Ready! (0.03s) Optimize a model with 35 rows, 128 columns and 360 nonzeros Presolve removed 6 rows and 10 columns Presolve time: 0.00s Presolved: 29 rows, 118 columns, 342 nonzeros Variable types: 0 continuous, 118 integer (0 binary) Found heuristic solution: objective 199.0000000 Found heuristic solution: objective 106.0000000 Optimize a model with 29 rows, 118 columns and 342 nonzeros Presolved: 29 rows, 118 columns, 342 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.280e+02 Factor NZ : 3.190e+02 Factor Ops : 4.639e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.33790866e+02 -1.23795874e+03 1.96e+02 2.22e-16 2.32e+01 0s 1 1.42462694e+02 -5.64301144e+02 3.62e+00 8.88e-16 3.09e+00 0s 2 8.97374041e+01 -9.15781077e+01 4.52e-02 1.94e-15 7.26e-01 0s 3 4.75238123e+01 1.74399181e+01 1.03e-03 2.22e-16 1.18e-01 0s 4 4.10951885e+01 3.85284168e+01 1.34e-04 4.44e-16 1.01e-02 0s 5 4.00040740e+01 3.99826375e+01 5.58e-08 2.47e-16 8.41e-05 0s 6 4.00000000e+01 4.00000000e+01 1.03e-13 1.53e-16 1.74e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 101 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 (101 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.04 seconds Objective: 40 Solution: 12 x [2, 8, 9, 14, 16] 1 x [2, 8, 11, 13, 18] 1 x [1, 4, 5, 6, 16] 2 x [3, 14, 15, 16, 18] 2 x [5, 7, 8, 13, 18] 1 x [6, 11, 13, 17, 18] 4 x [1, 4, 6, 12, 18] 11 x [1, 3, 4, 17, 19] 6 x [5, 5, 7, 10, 15]