Build (method = -2) #dp: 363 Step-3' Graph: 44 vertices and 122 arcs (0.00s) Step-4' Graph: 8 vertices and 50 arcs (0.00s) #V4/#V3 = 0.18 #A4/#A3 = 0.41 Ready! (0.00s) Optimize a model with 18 rows, 51 columns and 144 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 16 rows, 49 columns, 140 nonzeros Variable types: 0 continuous, 49 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 89.0000000 Optimize a model with 16 rows, 49 columns and 140 nonzeros Presolved: 16 rows, 49 columns, 140 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.400e+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.53841605e+02 -4.19900837e+02 8.01e+01 1.11e-16 1.67e+01 0s 1 6.51906391e+01 -1.54793584e+02 6.44e-01 4.44e-16 2.16e+00 0s 2 4.06766284e+01 -4.51080586e+01 7.05e-02 9.44e-16 8.09e-01 0s 3 2.66278293e+01 1.96987342e+01 1.02e-14 2.22e-16 6.42e-02 0s 4 2.50979591e+01 2.46542493e+01 3.64e-14 7.88e-17 4.11e-03 0s 5 2.50001081e+01 2.49997048e+01 4.69e-14 1.11e-16 3.73e-06 0s 6 2.50000000e+01 2.50000000e+01 4.50e-15 3.33e-16 3.75e-12 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 38 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 (38 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: 1 x [1, 2, 5, 7] 10 x [2, 6, 9, 10] 3 x [1, 4, 4, 7] 6 x [4, 4, 7, 8] 4 x [3, 7, 7, 10] 1 x [5, 7, 7, 10]