Build (method = -2) #dp: 315 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 3 rows and 4 columns Presolve time: 0.00s Presolved: 17 rows, 53 columns, 150 nonzeros Variable types: 0 continuous, 53 integer (8 binary) Found heuristic solution: objective 97.0000000 Found heuristic solution: objective 53.0000000 Optimize a model with 17 rows, 53 columns and 150 nonzeros Presolved: 17 rows, 53 columns, 150 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.900e+01 Factor NZ : 1.530e+02 Factor Ops : 1.785e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.54491647e+02 -4.20259559e+02 1.56e+02 6.50e-02 2.20e+01 0s 1 8.16313733e+01 -1.87679606e+02 8.32e+00 4.44e-16 2.99e+00 0s 2 3.70581016e+01 1.34947333e+00 4.09e-14 3.33e-16 3.14e-01 0s 3 2.60536241e+01 2.31112099e+01 1.57e-14 2.29e-16 2.58e-02 0s 4 2.50132011e+01 2.49696809e+01 6.65e-15 2.22e-16 3.82e-04 0s 5 2.50000006e+01 2.49999992e+01 3.13e-15 2.22e-16 1.24e-08 0s 6 2.50000000e+01 2.50000000e+01 1.61e-14 3.33e-16 1.80e-14 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 42 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 (42 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: 3 x [1, 3, 5, 9] 1 x [1, 3, 4, 6] 13 x [3, 4, 7, 8] 2 x [1, 7, 9, 10] 4 x [1, 4, 7, 9] 1 x [1, 2, 7, 9] 1 x [1, 7, 8, 9]