Build (method = -2) #dp: 2571 Step-3' Graph: 321 vertices and 956 arcs (0.02s) Step-4' Graph: 184 vertices and 682 arcs (0.02s) #V4/#V3 = 0.57 #A4/#A3 = 0.71 Ready! (0.02s) Optimize a model with 224 rows, 683 columns and 1685 nonzeros Presolve removed 16 rows and 16 columns Presolve time: 0.00s Presolved: 208 rows, 667 columns, 1639 nonzeros Variable types: 0 continuous, 667 integer (0 binary) Found heuristic solution: objective 484.0000000 Optimize a model with 208 rows, 667 columns and 1639 nonzeros Presolved: 208 rows, 667 columns, 1639 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.196e+03 Factor NZ : 4.934e+03 Factor Ops : 1.452e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.91572729e+03 -4.53481671e+04 4.13e+04 2.22e-16 1.77e+02 0s 1 1.62713021e+03 -1.84315576e+04 6.65e+03 5.55e-16 3.32e+01 0s 2 7.95827339e+02 -4.49418161e+03 1.30e+03 6.66e-16 6.73e+00 0s 3 5.12705981e+02 -6.51447663e+02 6.44e+01 2.44e-15 9.33e-01 0s 4 4.23474860e+02 -2.25878298e+02 8.74e+00 1.33e-15 4.84e-01 0s 5 3.86492628e+02 -4.75698882e+01 5.60e+00 8.88e-16 3.22e-01 0s 6 3.41573940e+02 8.76049758e+01 3.02e+00 4.44e-16 1.88e-01 0s 7 3.16539997e+02 1.70861261e+02 1.78e+00 3.19e-16 1.08e-01 0s 8 2.95242883e+02 2.16321637e+02 8.45e-01 2.72e-16 5.83e-02 0s 9 2.78597961e+02 2.52664438e+02 2.54e-01 2.28e-16 1.91e-02 0s 10 2.72875292e+02 2.62781563e+02 7.48e-02 3.03e-16 7.44e-03 0s 11 2.70619196e+02 2.65454613e+02 2.16e-02 2.86e-16 3.80e-03 0s 12 2.69534402e+02 2.68482532e+02 3.74e-03 3.33e-16 7.74e-04 0s 13 2.69225785e+02 2.69106172e+02 2.94e-04 4.44e-16 8.80e-05 0s 14 2.69200094e+02 2.69199859e+02 5.86e-07 3.33e-16 1.73e-07 0s 15 2.69200000e+02 2.69200000e+02 2.40e-10 2.94e-16 3.71e-13 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 2.69200000e+02 Root relaxation: objective 2.692000e+02, 178 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 269.20000 0 28 484.00000 269.20000 44.4% - 0s H 0 0 276.0000000 269.20000 2.46% - 0s H 0 0 272.0000000 269.20000 1.03% - 0s H 0 0 270.0000000 269.20000 0.30% - 0s Explored 0 nodes (324 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.700000000000e+02, best bound 2.700000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.04 seconds Total run time: 0.07 seconds Objective: 270 Solution: 16 x [10, 24] 9 x [2, 16, 20] 3 x [2, 16, 40] 11 x [4, 11, 19] 2 x [11, 19, 40] 4 x [23, 25] 2 x [11, 23, 40] 13 x [16, 23, 39] 14 x [14, 18] 18 x [3, 12] 7 x [33, 35] 3 x [11, 24, 33] 4 x [28, 30, 33, 34] 6 x [1, 15, 17] 12 x [1, 15, 32] 1 x [1, 18, 40] 1 x [1, 5, 30] 27 x [8, 36] 10 x [21, 38] 9 x [5, 21, 30] 13 x [7, 26] 2 x [7, 27] 6 x [15, 27, 29] 5 x [16, 18, 27] 3 x [9, 15, 22] 16 x [9, 29, 40] 2 x [9, 11, 18] 1 x [9, 11, 40] 1 x [13, 22] 2 x [13, 22, 31] 1 x [13, 22, 34] 9 x [13, 22, 34, 37] 11 x [6, 13, 39] 7 x [11, 13, 15, 28, 30] 1 x [7] 5 x [7, 24, 29] 13 x [17, 18, 32]