Build (method = -2) #dp: 242 Step-3' Graph: 45 vertices and 149 arcs (0.00s) Step-4' Graph: 40 vertices and 139 arcs (0.00s) #V4/#V3 = 0.89 #A4/#A3 = 0.93 Ready! (0.00s) Optimize a model with 49 rows, 140 columns and 355 nonzeros Presolve removed 12 rows and 17 columns Presolve time: 0.00s Presolved: 37 rows, 123 columns, 326 nonzeros Variable types: 0 continuous, 123 integer (15 binary) Found heuristic solution: objective 72.0000000 Found heuristic solution: objective 70.0000000 Optimize a model with 37 rows, 123 columns and 326 nonzeros Presolved: 37 rows, 123 columns, 326 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.810e+02 Factor NZ : 4.950e+02 Factor Ops : 7.767e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.84124656e+01 -1.31829288e+03 5.87e+02 2.22e-16 2.52e+01 0s 1 8.76053915e+01 -6.10576744e+02 9.07e+01 4.44e-16 5.11e+00 0s 2 7.00736489e+01 -6.39604607e+01 5.35e+00 4.44e-16 6.09e-01 0s 3 4.34627664e+01 -1.25814744e+01 3.46e-01 4.16e-16 2.28e-01 0s 4 3.66246634e+01 1.18325034e+01 1.09e-01 4.02e-16 1.00e-01 0s 5 3.39235295e+01 2.15253961e+01 3.89e-02 3.40e-16 4.98e-02 0s 6 3.24072223e+01 2.87556271e+01 1.36e-02 2.22e-16 1.47e-02 0s 7 3.18344361e+01 2.98282531e+01 3.50e-03 2.22e-16 8.04e-03 0s 8 3.15092791e+01 3.11311514e+01 3.46e-04 2.30e-16 1.51e-03 0s 9 3.14329342e+01 3.13908319e+01 7.64e-05 2.22e-16 1.69e-04 0s 10 3.14168965e+01 3.14164228e+01 4.25e-07 2.31e-16 1.90e-06 0s 11 3.14166669e+01 3.14166664e+01 3.23e-13 2.57e-16 1.90e-09 0s 12 3.14166667e+01 3.14166667e+01 8.43e-14 2.22e-16 1.90e-12 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 3.14166667e+01 Root relaxation: objective 3.141667e+01, 20 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 31.41667 0 10 70.00000 31.41667 55.1% - 0s H 0 0 34.0000000 31.41667 7.60% - 0s H 0 0 32.0000000 31.41667 1.82% - 0s Explored 0 nodes (26 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.200000000000e+01, best bound 3.200000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 32 Solution: 3 x [4, 6, 9] 1 x [3, 7] 1 x [2, 3, 6] 10 x [4, 5, 8] 4 x [4, 5, 6, 6] 8 x [1, 1] 4 x [6, 6, 7, 7, 7] 1 x [6, 6, 6, 8]