Build (method = -2) #dp: 224 Step-3' Graph: 38 vertices and 104 arcs (0.00s) Step-4' Graph: 6 vertices and 40 arcs (0.00s) #V4/#V3 = 0.16 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 15 rows, 41 columns and 118 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 13 rows, 39 columns, 114 nonzeros Variable types: 0 continuous, 39 integer (8 binary) Found heuristic solution: objective 97.0000000 Found heuristic solution: objective 85.0000000 Optimize a model with 13 rows, 39 columns and 114 nonzeros Presolved: 13 rows, 39 columns, 114 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.100e+01 Factor NZ : 9.100e+01 Factor Ops : 8.190e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.71945632e+02 -4.33139914e+02 1.22e+02 4.84e-02 2.76e+01 0s 1 8.32865343e+01 -2.01937054e+02 5.90e+00 3.33e-16 3.98e+00 0s 2 4.01180528e+01 4.57337259e+00 4.79e-04 1.67e-16 4.20e-01 0s 3 2.54311530e+01 2.23829739e+01 1.52e-05 1.11e-16 3.59e-02 0s 4 2.50021144e+01 2.49958003e+01 2.38e-14 3.33e-16 7.43e-05 0s 5 2.50000000e+01 2.50000000e+01 9.50e-15 3.33e-16 7.47e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 32 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 (32 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 [2, 3, 8, 9] 12 x [1, 3, 7, 9] 1 x [4, 6, 8, 8] 5 x [4, 5, 7, 8] 5 x [4, 5, 5, 8] 1 x [3, 5, 8, 8]