Build (method = -2) #dp: 413 Step-3' Graph: 46 vertices and 128 arcs (0.00s) Step-4' Graph: 10 vertices and 56 arcs (0.00s) #V4/#V3 = 0.22 #A4/#A3 = 0.44 Ready! (0.00s) Optimize a model with 20 rows, 57 columns and 158 nonzeros Presolve removed 4 rows and 6 columns Presolve time: 0.00s Presolved: 16 rows, 51 columns, 146 nonzeros Variable types: 0 continuous, 51 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 33.0000000 Optimize a model with 16 rows, 51 columns and 146 nonzeros Presolved: 16 rows, 51 columns, 146 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.500e+01 Factor NZ : 1.360e+02 Factor Ops : 1.496e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.39645819e+02 -4.20727222e+02 7.21e+01 0.00e+00 1.53e+01 0s 1 6.29043889e+01 -1.58262021e+02 9.59e-14 3.89e-16 2.03e+00 0s 2 3.64949219e+01 -6.48591741e+00 3.20e-14 4.44e-16 3.87e-01 0s 3 2.52018115e+01 2.22280478e+01 1.64e-14 6.66e-16 2.66e-02 0s 4 2.50013708e+01 2.49972202e+01 6.22e-15 3.33e-16 3.71e-05 0s 5 2.50000000e+01 2.50000000e+01 1.02e-14 6.66e-16 4.09e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 41 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 25.0000000 25.00000 0.0% - 0s Explored 0 nodes (41 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+01, best bound 2.500000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 25 Solution: 2 x [2, 6, 8, 10] 3 x [5, 6, 7, 10] 1 x [2, 4, 5, 6] 9 x [3, 4, 7, 9] 1 x [3, 4, 5, 7] 6 x [3, 7, 8, 8] 3 x [1, 4, 6, 8]