Build (method = -2) #dp: 300 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 (4 binary) Found heuristic solution: objective 98.0000000 Found heuristic solution: objective 85.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 3.79812987e+02 -4.23608691e+02 1.43e+02 6.78e-02 2.52e+01 0s 1 8.95224695e+01 -1.95706732e+02 8.53e+00 4.44e-16 3.48e+00 0s 2 4.01924830e+01 2.40290011e-01 5.51e-14 4.44e-16 3.75e-01 0s 3 2.58763587e+01 2.16807986e+01 1.84e-14 2.22e-16 3.92e-02 0s 4 2.50340979e+01 2.49417432e+01 1.38e-14 3.33e-16 8.63e-04 0s 5 2.50000072e+01 2.49999709e+01 1.03e-14 3.33e-16 3.38e-07 0s 6 2.50000000e+01 2.50000000e+01 3.27e-14 3.33e-16 3.41e-13 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 39 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 (39 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: 13 x [1, 2, 4, 7] 1 x [1, 2, 7, 7] 1 x [1, 3, 7, 10] 1 x [1, 5, 7, 10] 5 x [1, 6, 6, 8] 4 x [5, 6, 6, 9]