Build (method = -2) #dp: 3652 Step-3' Graph: 312 vertices and 1890 arcs (0.02s) Step-4' Graph: 274 vertices and 1814 arcs (0.02s) #V4/#V3 = 0.88 #A4/#A3 = 0.96 Ready! (0.02s) Optimize a model with 313 rows, 1815 columns and 4918 nonzeros Presolve removed 58 rows and 92 columns Presolve time: 0.03s Presolved: 255 rows, 1723 columns, 4788 nonzeros Variable types: 0 continuous, 1723 integer (0 binary) Found heuristic solution: objective 309.0000000 Optimize a model with 255 rows, 1723 columns and 4788 nonzeros Presolved: 255 rows, 1723 columns, 4788 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.892e+03 Factor NZ : 1.010e+04 Factor Ops : 6.061e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.98910864e+03 -4.10526537e+04 3.50e+04 2.22e-16 1.13e+02 0s 1 1.18645802e+03 -2.14331616e+04 7.37e+03 3.89e-15 2.56e+01 0s 2 5.11132332e+02 -9.24077115e+03 9.67e+02 2.02e-14 4.87e+00 0s 3 3.90998484e+02 -2.88193946e+03 8.77e+01 4.57e-14 1.08e+00 0s 4 3.65542471e+02 -8.70758878e+02 1.80e+01 1.43e-14 3.72e-01 0s 5 3.33717794e+02 -4.88085671e+02 1.08e+01 8.88e-15 2.44e-01 0s 6 2.98587803e+02 -2.38673126e+02 6.17e+00 5.00e-15 1.59e-01 0s 7 2.58099088e+02 -2.01135325e+01 2.59e+00 3.63e-15 8.15e-02 0s 8 2.11330889e+02 5.96976457e+01 7.06e-01 2.72e-15 4.40e-02 0s 9 1.90192985e+02 1.57317484e+02 1.84e-01 1.89e-15 9.56e-03 0s 10 1.83583023e+02 1.79137372e+02 3.25e-02 1.82e-15 1.30e-03 0s 11 1.82030881e+02 1.81867616e+02 1.72e-04 2.56e-15 4.72e-05 0s 12 1.82000001e+02 1.81999998e+02 5.43e-09 2.65e-15 9.33e-10 0s 13 1.82000000e+02 1.82000000e+02 3.52e-13 2.25e-15 2.29e-15 0s Barrier solved model in 13 iterations and 0.03 seconds Optimal objective 1.82000000e+02 Root relaxation: objective 1.820000e+02, 732 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 182.0000000 182.00000 0.0% - 0s Explored 0 nodes (861 simplex iterations) in 0.12 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.820000000000e+02, best bound 1.820000000000e+02, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.12 seconds Total run time: 0.16 seconds Objective: 182 Solution: 1 x [25, 38] 7 x [28, 36] 3 x [34] 4 x [25, 34] 9 x [31, 34] 1 x [14, 14, 31, 34] 4 x [14, 14, 14, 14, 31, 34] 3 x [30] 13 x [6, 30] 1 x [17, 30] 3 x [12, 30] 2 x [24] 2 x [20, 21] 1 x [9, 19] 5 x [2, 19] 3 x [2, 37] 5 x [3, 20] 8 x [3, 16] 4 x [17, 17, 39] 11 x [29, 35] 7 x [12, 29, 37] 3 x [29, 31, 33] 2 x [13, 27] 11 x [8, 27] 6 x [22] 6 x [8, 22] 1 x [12, 22] 2 x [4, 5] 5 x [5, 35] 3 x [5, 26] 9 x [5, 12, 15] 8 x [18, 28, 37] 2 x [11] 3 x [11, 23] 2 x [6, 11, 17] 7 x [11, 17] 2 x [7, 10] 5 x [10, 23] 5 x [10, 26] 1 x [10, 26, 31] 1 x [1, 32] 1 x [32, 32]