Build (method = -2) #dp: 81 Step-3' Graph: 23 vertices and 62 arcs (0.00s) Step-4' Graph: 13 vertices and 42 arcs (0.00s) #V4/#V3 = 0.57 #A4/#A3 = 0.68 Ready! (0.00s) Optimize a model with 23 rows, 43 columns and 107 nonzeros Presolve removed 6 rows and 7 columns Presolve time: 0.00s Presolved: 17 rows, 36 columns, 89 nonzeros Variable types: 0 continuous, 36 integer (0 binary) Found heuristic solution: objective 75.0000000 Found heuristic solution: objective 69.0000000 Optimize a model with 17 rows, 36 columns and 89 nonzeros Presolved: 17 rows, 36 columns, 89 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.100e+01 Factor NZ : 1.530e+02 Factor Ops : 1.785e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.15617738e+02 -4.73278948e+02 3.10e+02 2.22e-16 2.68e+01 0s 1 1.16439677e+02 -1.21815696e+02 2.77e+01 6.66e-16 3.93e+00 0s 2 6.80273520e+01 -1.54687752e+00 1.43e+00 2.78e-16 9.08e-01 0s 3 4.87636490e+01 4.02950046e+01 3.30e-04 2.22e-16 1.09e-01 0s 4 4.54356154e+01 4.46461619e+01 3.14e-05 1.11e-16 1.01e-02 0s 5 4.53434601e+01 4.53216365e+01 3.15e-07 2.22e-16 2.80e-04 0s 6 4.53333347e+01 4.53333324e+01 1.51e-11 2.22e-16 3.02e-08 0s 7 4.53333333e+01 4.53333333e+01 2.10e-12 2.22e-16 3.06e-14 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 4.53333333e+01 Root relaxation: objective 4.533333e+01, 12 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 45.33333 0 7 69.00000 45.33333 34.3% - 0s H 0 0 46.0000000 45.33333 1.45% - 0s Explored 0 nodes (15 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.600000000000e+01, best bound 4.600000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 46 Solution: 2 x [1, 7] 1 x [1, 8] 11 x [1, 9] 3 x [2, 4] 15 x [2, 5] 4 x [3, 4] 2 x [4, 6, 9] 6 x [4, 7, 8] 1 x [6, 9, 10] 1 x [7]