Build (method = -2) #dp: 2692 Step-3' Graph: 547 vertices and 1634 arcs (0.02s) Step-4' Graph: 249 vertices and 1038 arcs (0.02s) #V4/#V3 = 0.46 #A4/#A3 = 0.64 Ready! (0.02s) Optimize a model with 287 rows, 1039 columns and 2623 nonzeros Presolve removed 55 rows and 112 columns Presolve time: 0.01s Presolved: 232 rows, 927 columns, 2471 nonzeros Variable types: 0 continuous, 927 integer (6 binary) Found heuristic solution: objective 249.0000000 Optimize a model with 232 rows, 927 columns and 2471 nonzeros Presolved: 232 rows, 927 columns, 2471 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.667e+03 Factor NZ : 6.464e+03 Factor Ops : 2.464e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.44039368e+03 -1.57336134e+04 1.99e+04 2.22e-16 5.68e+01 0s 1 6.60164843e+02 -6.31730354e+03 3.99e+03 5.55e-16 1.22e+01 0s 2 3.82991809e+02 -1.97326181e+03 4.99e+02 2.22e-15 2.13e+00 0s 3 3.19311835e+02 -3.62867872e+02 7.72e+01 6.77e-15 4.51e-01 0s 4 2.83925211e+02 -1.19411060e+02 9.06e+00 3.77e-15 2.23e-01 0s 5 2.56851881e+02 -1.00789619e+01 3.47e+00 2.44e-15 1.45e-01 0s 6 2.40005900e+02 7.19254580e+01 1.96e+00 1.44e-15 9.08e-02 0s 7 2.27894404e+02 1.34943843e+02 1.14e+00 9.99e-16 5.01e-02 0s 8 2.13746213e+02 1.77156792e+02 2.91e-01 3.33e-16 1.97e-02 0s 9 2.09225525e+02 1.94858961e+02 6.13e-02 2.88e-16 7.70e-03 0s 10 2.07621811e+02 2.07282018e+02 1.96e-04 3.29e-16 1.82e-04 0s 11 2.07500025e+02 2.07499963e+02 3.85e-08 3.63e-16 3.31e-08 0s 12 2.07500000e+02 2.07500000e+02 9.66e-13 3.32e-16 3.34e-14 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 2.07500000e+02 Root relaxation: objective 2.075000e+02, 379 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 207.50000 0 11 249.00000 207.50000 16.7% - 0s H 0 0 208.0000000 207.50000 0.24% - 0s Explored 0 nodes (577 simplex iterations) in 0.05 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.080000000000e+02, best bound 2.080000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.05 seconds Total run time: 0.08 seconds Objective: 208 Solution: 27 x [1] 8 x [1, 31] 3 x [1, 37] 1 x [2] 1 x [2, 36] 4 x [3] 2 x [3, 30] 4 x [3, 31] 1 x [3, 37] 1 x [4, 28] 1 x [5] 4 x [6] 2 x [6, 28] 10 x [6, 29] 1 x [6, 32, 38] 3 x [6, 33, 37] 2 x [7] 8 x [7, 27] 6 x [7, 32, 37] 8 x [8, 29] 7 x [8, 31] 2 x [9] 3 x [9, 26] 7 x [10, 25] 2 x [11, 36] 2 x [12] 2 x [12, 34, 36] 2 x [12, 35, 36] 2 x [12, 36, 38] 7 x [13, 27, 36] 5 x [14, 24] 1 x [14, 25] 2 x [14, 38] 4 x [15, 23] 8 x [15, 25] 3 x [15, 26, 36] 2 x [15, 36] 8 x [16, 21] 13 x [16, 22] 10 x [17, 21] 1 x [18] 14 x [18, 20] 2 x [19, 20] 2 x [21, 22, 38]