Build (method = -2) #dp: 106 Step-3' Graph: 17 vertices and 61 arcs (0.00s) Step-4' Graph: 14 vertices and 55 arcs (0.00s) #V4/#V3 = 0.82 #A4/#A3 = 0.90 Ready! (0.00s) Optimize a model with 24 rows, 56 columns and 148 nonzeros Presolve removed 5 rows and 6 columns Presolve time: 0.00s Presolved: 19 rows, 50 columns, 134 nonzeros Variable types: 0 continuous, 50 integer (6 binary) Found heuristic solution: objective 95.0000000 Found heuristic solution: objective 90.0000000 Optimize a model with 19 rows, 50 columns and 134 nonzeros Presolved: 19 rows, 50 columns, 134 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.400e+01 Factor NZ : 1.900e+02 Factor Ops : 2.470e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.03002019e+02 -4.36078992e+02 5.66e+02 1.26e-01 2.62e+01 0s 1 1.25307373e+02 -1.60069773e+02 6.23e+01 3.33e-16 4.03e+00 0s 2 6.25819797e+01 3.64944844e+00 1.71e+00 2.22e-16 5.64e-01 0s 3 4.90974673e+01 3.62266653e+01 3.21e-01 1.11e-16 1.21e-01 0s 4 4.55718320e+01 4.32633952e+01 2.83e-02 3.33e-16 2.16e-02 0s 5 4.50200742e+01 4.45357772e+01 6.08e-03 2.26e-16 4.53e-03 0s 6 4.48975339e+01 4.48722366e+01 1.79e-04 3.33e-16 2.37e-04 0s 7 4.48888900e+01 4.48888860e+01 1.30e-08 1.91e-16 3.73e-08 0s 8 4.48888889e+01 4.48888889e+01 8.16e-15 2.22e-16 3.73e-11 0s Barrier solved model in 8 iterations and 0.00 seconds Optimal objective 4.48888889e+01 Root relaxation: objective 4.488889e+01, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 44.88889 0 12 90.00000 44.88889 50.1% - 0s H 0 0 46.0000000 44.88889 2.42% - 0s H 0 0 45.0000000 44.88889 0.25% - 0s Explored 0 nodes (8 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.500000000000e+01, best bound 4.500000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.01 seconds Objective: 45 Solution: 1 x [3, 7] 13 x [3, 5] 3 x [4, 6] 2 x [1, 8] 6 x [1, 4] 11 x [2, 8] 3 x [8, 8] 3 x [4, 9, 10] 2 x [5, 5, 5, 9] 1 x [5, 10, 10, 10, 10]