Build (method = -2) #dp: 5104 Step-3' Graph: 91 vertices and 262 arcs (0.02s) Step-4' Graph: 11 vertices and 102 arcs (0.02s) #V4/#V3 = 0.12 #A4/#A3 = 0.39 Ready! (0.02s) Optimize a model with 28 rows, 103 columns and 295 nonzeros Presolve removed 4 rows and 6 columns Presolve time: 0.00s Presolved: 24 rows, 97 columns, 283 nonzeros Variable types: 0 continuous, 97 integer (0 binary) Found heuristic solution: objective 199.0000000 Found heuristic solution: objective 138.0000000 Optimize a model with 24 rows, 97 columns and 283 nonzeros Presolved: 24 rows, 97 columns, 283 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.030e+02 Factor NZ : 3.000e+02 Factor Ops : 4.900e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.57051361e+02 -1.24931916e+03 1.52e+02 2.22e-16 2.81e+01 0s 1 1.40510266e+02 -5.68834502e+02 1.91e+00 5.55e-16 3.67e+00 0s 2 9.68820227e+01 -1.30369613e+02 2.13e-01 3.33e-16 1.11e+00 0s 3 5.27932031e+01 1.17132340e+01 1.62e-04 2.22e-16 1.95e-01 0s 4 4.13417831e+01 3.77618505e+01 1.22e-05 2.22e-16 1.70e-02 0s 5 4.00044617e+01 3.99814589e+01 1.89e-08 2.22e-16 1.09e-04 0s 6 4.00000000e+01 4.00000000e+01 3.30e-14 2.22e-16 1.41e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 84 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 (84 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.03 seconds Gurobi run time: 0.00 seconds Total run time: 0.03 seconds Objective: 40 Solution: 10 x [2, 3, 5, 8, 13] 3 x [7, 10, 11, 14, 16] 13 x [1, 4, 6, 14, 16] 1 x [1, 5, 12, 15, 17] 4 x [5, 8, 11, 12, 15] 2 x [1, 1, 5, 9, 15] 6 x [1, 7, 10, 13, 17] 1 x [1, 1, 9, 15, 17]