Build (method = -2) #dp: 13308 Step-3' Graph: 226 vertices and 1133 arcs (0.07s) Step-4' Graph: 161 vertices and 1003 arcs (0.07s) #V4/#V3 = 0.71 #A4/#A3 = 0.89 Ready! (0.07s) Optimize a model with 181 rows, 1004 columns and 2699 nonzeros Presolve removed 25 rows and 44 columns Presolve time: 0.01s Presolved: 156 rows, 960 columns, 2666 nonzeros Variable types: 0 continuous, 960 integer (0 binary) Found heuristic solution: objective 1828.0000000 Found heuristic solution: objective 1769.0000000 Optimize a model with 156 rows, 960 columns and 2666 nonzeros Presolved: 156 rows, 960 columns, 2666 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.474e+03 Factor NZ : 4.419e+03 Factor Ops : 1.491e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.41549542e+04 -2.73856439e+05 2.15e+05 2.22e-16 1.28e+03 0s 1 8.54763378e+03 -1.21314594e+05 3.23e+04 7.77e-16 2.17e+02 0s 2 3.36225015e+03 -4.59516706e+04 6.16e+03 1.33e-15 4.88e+01 0s 3 1.97108210e+03 -1.12529433e+04 2.02e+02 2.66e-15 7.38e+00 0s 4 1.51292573e+03 -4.54552318e+03 9.57e+00 1.44e-15 3.14e+00 0s 5 1.01155544e+03 -1.34691153e+03 5.84e+00 7.22e-16 1.22e+00 0s 6 7.45741077e+02 -4.86667246e+02 3.76e+00 5.67e-16 6.39e-01 0s 7 4.43403094e+02 -1.44423037e+02 1.76e+00 6.52e-16 3.05e-01 0s 8 3.87594346e+02 1.10533557e+02 8.51e-01 7.38e-16 1.43e-01 0s 9 3.62530399e+02 2.34892372e+02 4.75e-01 5.81e-16 6.60e-02 0s 10 3.34010950e+02 3.29800507e+02 3.74e-04 6.66e-16 2.17e-03 0s 11 3.33335899e+02 3.33329620e+02 8.23e-13 5.55e-16 3.24e-06 0s 12 3.33333336e+02 3.33333330e+02 1.34e-12 4.99e-16 3.24e-09 0s 13 3.33333333e+02 3.33333333e+02 3.06e-13 5.26e-16 4.33e-15 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 3.33333333e+02 Root relaxation: objective 3.333333e+02, 708 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 333.33333 0 16 1769.00000 333.33333 81.2% - 0s H 0 0 335.0000000 333.33333 0.50% - 0s H 0 0 334.0000000 333.33333 0.20% - 0s Explored 0 nodes (1129 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.340000000000e+02, best bound 3.340000000000e+02, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.07 seconds Total run time: 0.15 seconds Objective: 334 Solution: 42 x [1, 3, 3, 7, 11, 16] 25 x [7, 11, 12, 16, 16, 16] 5 x [2, 3, 3, 5, 7, 16] 3 x [3, 3, 6, 14, 16, 20] 1 x [6, 10, 14, 16, 20] 1 x [6, 10, 10, 11, 14, 16] 89 x [2, 6, 9, 11, 15, 18] 8 x [2, 6, 6, 9, 15, 18] 6 x [2, 6, 6, 9, 18, 18] 3 x [4, 6, 6, 6, 9, 19] 2 x [4, 9, 13, 17, 17, 19] 58 x [3, 9, 13, 17, 17, 19] 6 x [3, 3, 13, 17, 17, 19] 14 x [13, 17, 17, 19, 19, 19] 1 x [4, 9, 13, 17, 17] 1 x [3, 13, 17, 17] 44 x [13, 13, 20, 20, 20, 20] 1 x [20, 20, 20, 20, 20, 20] 18 x [4, 8, 9, 11, 16, 19] 6 x [3, 10, 10, 11, 16, 16]