Build (method = -2) #dp: 645 Step-3' Graph: 74 vertices and 212 arcs (0.00s) Step-4' Graph: 30 vertices and 124 arcs (0.00s) #V4/#V3 = 0.41 #A4/#A3 = 0.58 Ready! (0.00s) Optimize a model with 39 rows, 125 columns and 322 nonzeros Presolve removed 17 rows and 33 columns Presolve time: 0.00s Presolved: 22 rows, 92 columns, 261 nonzeros Variable types: 0 continuous, 92 integer (0 binary) Found heuristic solution: objective 150.0000000 Found heuristic solution: objective 134.0000000 Optimize a model with 22 rows, 92 columns and 261 nonzeros Presolved: 22 rows, 92 columns, 261 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.060e+02 Factor NZ : 2.530e+02 Factor Ops : 3.795e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.02104044e+02 -1.25276087e+03 4.32e+02 2.22e-16 3.36e+01 0s 1 1.53886081e+02 -4.06669938e+02 2.03e+01 3.33e-16 3.90e+00 0s 2 6.01869755e+01 -5.32924304e+01 9.16e-01 3.33e-16 6.05e-01 0s 3 3.11883289e+01 1.50835425e+01 2.22e-02 1.67e-16 8.36e-02 0s 4 2.63228249e+01 2.43965083e+01 2.71e-03 3.33e-16 9.99e-03 0s 5 2.58462043e+01 2.58138147e+01 1.38e-05 3.08e-16 1.68e-04 0s 6 2.58333334e+01 2.58333331e+01 1.23e-10 2.40e-16 1.49e-09 0s 7 2.58333333e+01 2.58333333e+01 4.05e-14 1.12e-16 1.62e-15 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 2.58333333e+01 Root relaxation: objective 2.583333e+01, 68 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.83333 0 6 134.00000 25.83333 80.7% - 0s H 0 0 26.0000000 25.83333 0.64% - 0s Explored 0 nodes (74 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.600000000000e+01, best bound 2.600000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 26 Solution: 4 x [2, 3, 3, 3, 3, 4] 5 x [3, 3, 3, 3, 3, 8] 1 x [1, 3, 4, 6, 7, 9] 2 x [1, 3, 3, 6, 7, 9] 13 x [3, 3, 3, 3, 3, 5] 1 x [1, 4, 6, 7, 9]