Build (method = -2) #dp: 5149 Step-3' Graph: 108 vertices and 1303 arcs (0.02s) Step-4' Graph: 75 vertices and 1237 arcs (0.02s) #V4/#V3 = 0.69 #A4/#A3 = 0.95 Ready! (0.02s) Optimize a model with 146 rows, 1238 columns and 3570 nonzeros Presolve removed 25 rows and 40 columns Presolve time: 0.02s Presolved: 121 rows, 1198 columns, 3454 nonzeros Variable types: 0 continuous, 1198 integer (52 binary) Found heuristic solution: objective 223.0000000 Found heuristic solution: objective 175.0000000 Optimize a model with 121 rows, 1198 columns and 3454 nonzeros Presolved: 121 rows, 1198 columns, 3454 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.089e+03 Factor NZ : 3.865e+03 Factor Ops : 1.676e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.35940417e+03 -1.38952289e+04 2.36e+04 2.28e-01 6.04e+01 0s 1 1.61283425e+03 -3.71817284e+03 4.48e+03 2.22e-15 1.15e+01 0s 2 3.26920823e+02 -1.61230537e+03 3.56e+02 7.55e-15 1.44e+00 0s 3 1.85663009e+02 -4.56050794e+02 1.57e+01 3.11e-15 2.82e-01 0s 4 1.46587254e+02 -2.30887823e+02 4.54e+00 2.00e-15 1.59e-01 0s 5 1.21188574e+02 -2.60121550e+01 1.78e+00 8.88e-16 6.11e-02 0s 6 1.07572026e+02 4.41836017e+01 6.54e-01 5.55e-16 2.61e-02 0s 7 1.02167757e+02 7.95003570e+01 1.82e-01 5.55e-16 9.31e-03 0s 8 9.95781564e+01 9.29861760e+01 1.62e-02 4.40e-16 2.70e-03 0s 9 9.90128459e+01 9.67399013e+01 5.14e-03 3.41e-16 9.31e-04 0s 10 9.87204935e+01 9.78580322e+01 1.05e-03 3.61e-16 3.53e-04 0s 11 9.86020141e+01 9.82885360e+01 2.32e-04 3.57e-16 1.28e-04 0s 12 9.85731830e+01 9.84522735e+01 1.08e-04 4.45e-16 4.95e-05 0s 13 9.85620200e+01 9.85259359e+01 4.00e-05 3.33e-16 1.48e-05 0s 14 9.85536403e+01 9.85524950e+01 2.77e-13 3.69e-16 4.69e-07 0s 15 9.85533333e+01 9.85533333e+01 7.23e-14 5.55e-16 1.67e-11 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 9.85533333e+01 Root relaxation: objective 9.855333e+01, 400 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 98.55333 0 49 175.00000 98.55333 43.7% - 0s H 0 0 101.0000000 98.55333 2.42% - 0s H 0 0 100.0000000 98.55333 1.45% - 0s 0 0 98.55333 0 66 100.00000 98.55333 1.45% - 0s 0 0 98.55333 0 69 100.00000 98.55333 1.45% - 0s H 0 0 99.0000000 98.55333 0.45% - 0s Cutting planes: Zero half: 1 Explored 0 nodes (762 simplex iterations) in 0.27 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.900000000000e+01, best bound 9.900000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.27 seconds Total run time: 0.30 seconds Objective: 99 Solution: 2 x [27, 71] 1 x [3, 71] 1 x [2, 9, 70] 1 x [4, 7, 70] 2 x [28, 69] 3 x [1, 11, 69] 1 x [2, 10, 69] 2 x [5, 7, 69] 3 x [29, 68] 1 x [5, 9, 67] 1 x [7, 7, 67] 3 x [30, 66] 1 x [1, 14, 65] 1 x [3, 12, 65] 2 x [31, 64] 2 x [32, 63] 1 x [6, 11, 63] 2 x [33, 62] 3 x [34, 61] 2 x [36, 60] 1 x [4, 17, 59] 1 x [37, 58] 1 x [2, 20, 57] 2 x [3, 19, 57] 2 x [39, 56] 1 x [3, 20, 56] 1 x [12, 12, 56] 1 x [8, 56] 2 x [40, 55] 1 x [41, 54] 1 x [4, 21, 54] 1 x [10, 16, 54] 4 x [42, 53] 6 x [43, 52] 2 x [44, 51] 2 x [10, 18, 51] 3 x [45, 50] 1 x [10, 19, 50] 1 x [12, 15, 50] 1 x [14, 14, 50] 2 x [47, 49] 1 x [48, 48] 1 x [16, 16, 47] 1 x [14, 18, 46] 3 x [16, 17, 46] 1 x [13, 25, 40] 2 x [14, 24, 40] 1 x [13, 26, 39] 1 x [17, 23, 38] 1 x [19, 20, 38] 1 x [9, 31, 37] 1 x [20, 22, 36] 1 x [18, 25, 35] 1 x [20, 23, 35] 1 x [15, 29, 34] 2 x [22, 22, 34] 2 x [20, 26, 32] 2 x [21, 26, 31] 2 x [23, 24, 31] 2 x [19, 29, 30]