Build (method = -2) #dp: 2381 Step-3' Graph: 60 vertices and 804 arcs (0.01s) Step-4' Graph: 60 vertices and 804 arcs (0.01s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.01s) Optimize a model with 141 rows, 805 columns and 2303 nonzeros Presolve removed 52 rows and 57 columns Presolve time: 0.01s Presolved: 89 rows, 748 columns, 2139 nonzeros Variable types: 0 continuous, 748 integer (0 binary) Found heuristic solution: objective 483.0000000 Found heuristic solution: objective 381.0000000 Optimize a model with 89 rows, 748 columns and 2139 nonzeros Presolved: 89 rows, 748 columns, 2139 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.136e+03 Factor NZ : 2.237e+03 Factor Ops : 7.540e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.38843645e+03 -8.55623710e+03 2.85e+04 2.22e-16 5.15e+01 0s 1 1.15329126e+03 -2.93021233e+03 4.51e+03 5.55e-16 9.07e+00 0s 2 5.00115967e+02 -8.69261937e+02 2.08e+02 2.66e-15 1.12e+00 0s 3 4.25236223e+02 -1.50116785e+02 3.77e+00 1.78e-15 3.79e-01 0s 4 3.63509641e+02 1.39529143e+02 5.36e-01 5.55e-16 1.47e-01 0s 5 3.40429882e+02 2.24561162e+02 1.54e-01 2.91e-16 7.59e-02 0s 6 3.27648233e+02 2.90492397e+02 4.46e-02 3.47e-16 2.43e-02 0s 7 3.24355226e+02 3.20953663e+02 1.82e-02 7.77e-16 2.24e-03 0s 8 3.22531638e+02 3.22408107e+02 2.88e-04 6.59e-16 8.10e-05 0s 9 3.22500083e+02 3.22499938e+02 5.93e-07 5.55e-16 9.48e-08 0s 10 3.22500000e+02 3.22500000e+02 3.94e-13 5.52e-16 9.48e-11 0s 11 3.22500000e+02 3.22500000e+02 3.41e-13 5.58e-16 1.35e-16 0s Barrier solved model in 11 iterations and 0.01 seconds Optimal objective 3.22500000e+02 Root relaxation: objective 3.225000e+02, 183 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 322.50000 0 7 381.00000 322.50000 15.4% - 0s H 0 0 324.0000000 322.50000 0.46% - 0s H 0 0 323.0000000 322.50000 0.15% - 0s Explored 0 nodes (216 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.230000000000e+02, best bound 3.230000000000e+02, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.03 seconds Total run time: 0.04 seconds Objective: 323 Solution: 6 x [81] 10 x [80] 7 x [79] 2 x [78] 10 x [77] 7 x [76] 5 x [75] 7 x [74] 7 x [73] 6 x [72] 6 x [71] 10 x [70] 2 x [69] 5 x [68] 4 x [67] 3 x [66] 5 x [65] 7 x [64] 3 x [63] 1 x [62] 10 x [1, 61] 1 x [60] 4 x [2, 60] 1 x [3, 59] 6 x [2, 59] 3 x [3, 58] 4 x [5, 57] 4 x [4, 57] 6 x [6, 56] 1 x [3, 56] 12 x [55] 7 x [54] 9 x [53] 5 x [10, 52] 2 x [8, 52] 1 x [9, 51] 5 x [7, 51] 6 x [12, 50] 1 x [8, 50] 3 x [9, 49] 3 x [14, 48] 1 x [13, 48] 4 x [11, 48] 3 x [15, 47] 9 x [13, 46] 6 x [17, 45] 4 x [17, 44] 6 x [19, 43] 1 x [18, 43] 5 x [20, 42] 1 x [18, 42] 3 x [16, 42] 3 x [41] 4 x [21, 41] 1 x [1, 41] 6 x [22, 40] 1 x [21, 40] 4 x [23, 39] 5 x [24, 38] 2 x [24, 37] 9 x [26, 36] 7 x [27, 35] 1 x [24, 35] 6 x [25, 34] 2 x [23, 34] 4 x [29, 33] 4 x [30, 32] 5 x [28, 32] 1 x [31] 3 x [31, 31] 3 x [26, 30] 2 x [25, 28]