Build (method = -2) #dp: 1750 Step-3' Graph: 235 vertices and 771 arcs (0.01s) Step-4' Graph: 217 vertices and 735 arcs (0.01s) #V4/#V3 = 0.92 #A4/#A3 = 0.95 Ready! (0.01s) Optimize a model with 227 rows, 736 columns and 1779 nonzeros Presolve removed 80 rows and 158 columns Presolve time: 0.01s Presolved: 147 rows, 578 columns, 1482 nonzeros Variable types: 0 continuous, 578 integer (0 binary) Found heuristic solution: objective 917.0000000 Optimize a model with 147 rows, 578 columns and 1482 nonzeros Presolved: 147 rows, 578 columns, 1482 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.300e+02 Factor NZ : 3.065e+03 Factor Ops : 7.306e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.97413001e+03 -1.27144598e+05 6.99e+04 2.22e-16 6.22e+02 0s 1 1.60738093e+03 -7.03746103e+04 1.16e+04 7.77e-16 1.33e+02 0s 2 1.03846328e+03 -2.27288351e+04 1.48e+03 1.20e-14 2.66e+01 0s 3 9.84011240e+02 -1.94228091e+03 6.71e+01 1.07e-14 2.66e+00 0s 4 9.08642201e+02 -4.74830771e+02 1.34e-02 4.44e-15 1.19e+00 0s 5 8.54720430e+02 -1.61848985e+02 1.00e-02 3.22e-15 8.75e-01 0s 6 7.78250529e+02 1.00915361e+02 6.06e-03 2.44e-15 5.83e-01 0s 7 6.30516577e+02 2.70797014e+02 2.20e-03 3.13e-15 3.10e-01 0s 8 5.63476226e+02 3.58600917e+02 8.62e-04 2.97e-15 1.76e-01 0s 9 5.43236594e+02 4.68447669e+02 2.39e-04 2.70e-15 6.44e-02 0s 10 5.32400387e+02 5.31577504e+02 2.04e-06 1.81e-15 7.08e-04 0s 11 5.32000401e+02 5.31999578e+02 1.51e-12 2.37e-15 7.08e-07 0s 12 5.32000000e+02 5.32000000e+02 2.22e-12 1.55e-15 7.08e-10 0s 13 5.32000000e+02 5.32000000e+02 1.02e-12 1.56e-15 8.96e-16 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 5.32000000e+02 Root relaxation: objective 5.320000e+02, 251 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 532.0000000 532.00000 0.0% - 0s Explored 0 nodes (251 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.320000000000e+02, best bound 5.320000000000e+02, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.02 seconds Total run time: 0.04 seconds Objective: 532 Solution: 49 x [6] 59 x [6, 9] 79 x [1, 4, 6] 1 x [6, 10, 10] 108 x [5, 7] 44 x [3] 53 x [3, 7] 85 x [2] 31 x [2, 4, 4] 1 x [1, 1, 2, 4, 4] 22 x [8, 8]