Build (method = -2) #dp: 12978 Step-3' Graph: 153 vertices and 492 arcs (0.06s) Step-4' Graph: 71 vertices and 328 arcs (0.06s) #V4/#V3 = 0.46 #A4/#A3 = 0.67 Ready! (0.06s) Optimize a model with 89 rows, 329 columns and 852 nonzeros Presolve removed 24 rows and 46 columns Presolve time: 0.00s Presolved: 65 rows, 283 columns, 766 nonzeros Variable types: 0 continuous, 283 integer (6 binary) Found heuristic solution: objective 176.0000000 Found heuristic solution: objective 121.0000000 Optimize a model with 65 rows, 283 columns and 766 nonzeros Presolved: 65 rows, 283 columns, 766 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.840e+02 Factor NZ : 9.860e+02 Factor Ops : 1.739e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.42445095e+03 -6.40249077e+03 5.00e+03 1.08e-01 8.91e+01 0s 1 5.53675936e+02 -2.61789590e+03 5.65e+02 5.55e-16 1.27e+01 0s 2 1.89612577e+02 -8.12984408e+02 4.32e+01 5.00e-16 2.10e+00 0s 3 1.09008351e+02 -1.55896540e+02 2.72e-01 3.33e-16 4.56e-01 0s 4 5.60956493e+01 -3.95123257e+01 7.04e-02 2.64e-16 1.64e-01 0s 5 3.99435272e+01 1.04819961e+01 3.25e-02 1.60e-16 5.06e-02 0s 6 3.62279067e+01 2.46787911e+01 1.42e-02 1.80e-16 1.98e-02 0s 7 3.45695278e+01 3.15536905e+01 2.07e-04 2.22e-16 5.17e-03 0s 8 3.33417048e+01 3.32166699e+01 3.24e-07 2.22e-16 2.14e-04 0s 9 3.33333345e+01 3.33333280e+01 1.03e-12 3.33e-16 1.11e-08 0s 10 3.33333333e+01 3.33333333e+01 9.37e-14 3.33e-16 1.11e-11 0s Barrier solved model in 10 iterations and 0.00 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 195 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 33.33333 0 12 121.00000 33.33333 72.5% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (269 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.400000000000e+01, best bound 3.400000000000e+01, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.01 seconds Total run time: 0.08 seconds Objective: 34 Solution: 13 x [3, 5, 7, 7, 8, 16] 5 x [7, 13, 14, 17, 18, 18] 5 x [9, 11, 12, 13, 13, 17] 1 x [3, 7, 7, 8, 9] 3 x [1, 4, 8, 9, 10, 12] 2 x [11, 11, 14, 15, 15, 16] 1 x [3, 3, 12, 14, 17] 3 x [6, 11, 12, 12, 14, 14] 1 x [2, 6, 8, 10]