Build (method = -2) #dp: 3050 Step-3' Graph: 82 vertices and 236 arcs (0.01s) Step-4' Graph: 6 vertices and 84 arcs (0.01s) #V4/#V3 = 0.07 #A4/#A3 = 0.36 Ready! (0.01s) Optimize a model with 26 rows, 85 columns and 250 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 24 rows, 83 columns, 246 nonzeros Variable types: 0 continuous, 83 integer (8 binary) Found heuristic solution: objective 197.0000000 Found heuristic solution: objective 185.0000000 Optimize a model with 24 rows, 83 columns and 246 nonzeros Presolved: 24 rows, 83 columns, 246 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.500e+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 8.42729394e+02 -9.17144840e+02 1.27e+02 2.61e-02 3.12e+01 0s 1 1.71098666e+02 -4.80255534e+02 4.26e+00 3.33e-16 4.20e+00 0s 2 9.43059875e+01 -1.28611517e+01 2.57e-02 3.33e-16 5.92e-01 0s 3 5.07565471e+01 3.72857006e+01 6.90e-04 1.11e-16 7.32e-02 0s 4 5.00131381e+01 4.99574150e+01 2.72e-14 3.33e-16 3.03e-04 0s 5 5.00000010e+01 4.99999985e+01 6.04e-14 1.11e-16 1.35e-08 0s 6 5.00000000e+01 5.00000000e+01 2.22e-14 1.11e-16 1.36e-14 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 5.00000000e+01 Root relaxation: objective 5.000000e+01, 72 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 (72 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.02 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 50 Solution: 13 x [4, 12, 14, 19] 6 x [1, 7, 15, 20] 8 x [2, 8, 10, 13] 3 x [1, 2, 12, 18] 1 x [5, 7, 9, 10] 11 x [6, 9, 16, 17] 2 x [8, 11, 16, 16] 1 x [1, 3, 7, 11] 4 x [1, 2, 6, 11] 1 x [1, 11, 16, 18]