Build (method = -2) #dp: 1871 Step-3' Graph: 74 vertices and 212 arcs (0.01s) Step-4' Graph: 10 vertices and 84 arcs (0.01s) #V4/#V3 = 0.14 #A4/#A3 = 0.40 Ready! (0.01s) Optimize a model with 27 rows, 85 columns and 242 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.00s Presolved: 24 rows, 81 columns, 234 nonzeros Variable types: 0 continuous, 81 integer (0 binary) Found heuristic solution: objective 199.0000000 Found heuristic solution: objective 103.0000000 Optimize a model with 24 rows, 81 columns and 234 nonzeros Presolved: 24 rows, 81 columns, 234 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.700e+01 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 5.36702184e+02 -8.78011899e+02 1.20e+02 2.22e-16 2.17e+01 0s 1 1.39810238e+02 -3.62363639e+02 2.66e+00 3.33e-16 3.10e+00 0s 2 8.31865623e+01 -2.20763171e+01 2.89e-02 2.83e-15 5.96e-01 0s 3 5.08807468e+01 4.10934798e+01 4.83e-04 2.22e-16 5.47e-02 0s 4 5.00623041e+01 4.97247020e+01 2.26e-05 7.29e-17 1.89e-03 0s 5 5.00000157e+01 4.99998648e+01 2.01e-14 2.90e-16 8.43e-07 0s 6 5.00000000e+01 5.00000000e+01 1.61e-14 1.11e-16 8.43e-13 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 5.00000000e+01 Root relaxation: objective 5.000000e+01, 68 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 50.0000000 50.00000 0.0% - 0s Explored 0 nodes (68 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.000000000000e+01, best bound 5.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 50 Solution: 15 x [2, 5, 8, 13] 1 x [1, 8, 11, 11] 11 x [10, 14, 15, 17] 3 x [1, 2, 3, 7] 2 x [1, 3, 7, 12] 3 x [1, 3, 7, 14] 13 x [4, 6, 9, 16] 1 x [1, 6, 9, 12] 1 x [1, 6, 6, 9]