Build (method = -2) #dp: 6978 Step-3' Graph: 105 vertices and 305 arcs (0.03s) Step-4' Graph: 14 vertices and 123 arcs (0.03s) #V4/#V3 = 0.13 #A4/#A3 = 0.40 Ready! (0.03s) Optimize a model with 34 rows, 124 columns and 351 nonzeros Presolve removed 6 rows and 10 columns Presolve time: 0.00s Presolved: 28 rows, 114 columns, 332 nonzeros Variable types: 0 continuous, 114 integer (0 binary) Found heuristic solution: objective 194.0000000 Found heuristic solution: objective 134.0000000 Optimize a model with 28 rows, 114 columns and 332 nonzeros Presolved: 28 rows, 114 columns, 332 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.220e+02 Factor NZ : 3.280e+02 Factor Ops : 5.098e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.61655305e+02 -1.43104757e+03 1.39e+02 1.11e-16 2.64e+01 0s 1 2.10854229e+02 -5.79400355e+02 9.65e+00 4.44e-16 4.13e+00 0s 2 8.90115287e+01 -4.03407519e+01 4.51e-02 4.44e-16 5.27e-01 0s 3 4.40787474e+01 1.87749014e+01 3.81e-03 3.33e-16 1.02e-01 0s 4 4.06176962e+01 3.76360639e+01 5.42e-04 1.11e-16 1.20e-02 0s 5 4.00027981e+01 3.99808045e+01 4.51e-14 2.41e-16 8.87e-05 0s 6 4.00000000e+01 3.99999999e+01 3.32e-14 4.44e-16 2.46e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 99 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 (99 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: 2 x [1, 7, 10, 14, 19] 1 x [2, 4, 6, 11, 20] 2 x [2, 5, 12, 18, 20] 12 x [3, 4, 11, 13, 17] 4 x [7, 14, 14, 15, 20] 6 x [5, 5, 8, 9, 12] 10 x [12, 16, 18, 19, 20] 3 x [5, 6, 8, 10, 14]