Build (method = -2) #dp: 309 Step-3' Graph: 42 vertices and 116 arcs (0.00s) Step-4' Graph: 6 vertices and 44 arcs (0.00s) #V4/#V3 = 0.14 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 16 rows, 45 columns and 130 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 14 rows, 43 columns, 126 nonzeros Variable types: 0 continuous, 43 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 93.0000000 Optimize a model with 14 rows, 43 columns and 126 nonzeros Presolved: 14 rows, 43 columns, 126 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.500e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.49284063e+02 -4.35992840e+02 4.55e+01 1.11e-16 1.76e+01 0s 1 6.42875226e+01 -1.62252156e+02 2.13e-14 2.22e-16 2.44e+00 0s 2 3.65993475e+01 3.59019375e+00 3.20e-14 3.33e-16 3.47e-01 0s 3 2.51790908e+01 2.32507738e+01 1.60e-14 2.22e-16 2.01e-02 0s 4 2.50002453e+01 2.49982522e+01 6.44e-15 2.22e-16 2.08e-05 0s 5 2.50000000e+01 2.50000000e+01 2.09e-14 2.22e-16 2.08e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 36 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 (36 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 [3, 8, 9, 10] 6 x [5, 9, 10, 10] 9 x [1, 2, 3, 4] 3 x [3, 4, 5, 6] 5 x [2, 5, 7, 8] 1 x [2, 5, 5, 6]