Build (method = -2) #dp: 6017 Step-3' Graph: 195 vertices and 2056 arcs (0.03s) Step-4' Graph: 95 vertices and 1856 arcs (0.03s) #V4/#V3 = 0.49 #A4/#A3 = 0.90 Ready! (0.03s) Optimize a model with 181 rows, 1857 columns and 5387 nonzeros Presolve removed 9 rows and 19 columns Presolve time: 0.03s Presolved: 172 rows, 1838 columns, 4983 nonzeros Variable types: 0 continuous, 1838 integer (1294 binary) Found heuristic solution: objective 62.0000000 Optimize a model with 172 rows, 1838 columns and 4983 nonzeros Presolved: 172 rows, 1838 columns, 4983 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.761e+03 Factor NZ : 5.901e+03 Factor Ops : 2.918e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.94375571e+03 -1.02963123e+04 1.17e+04 2.75e-01 1.74e+01 0s 1 1.21037132e+03 -2.15552392e+03 2.28e+03 5.55e-16 3.32e+00 0s 2 1.84298066e+02 -4.73438008e+02 1.81e+02 5.00e-16 3.50e-01 0s 3 7.17384672e+01 -4.99791286e+01 1.38e+01 2.78e-16 4.33e-02 0s 4 5.37137594e+01 1.81627480e+00 5.26e+00 2.22e-16 1.69e-02 0s 5 4.87527532e+01 2.30817972e+01 3.06e+00 3.33e-16 7.94e-03 0s 6 4.51253371e+01 3.52529325e+01 1.46e+00 3.33e-16 2.97e-03 0s 7 4.26347443e+01 3.74566836e+01 6.23e-01 2.22e-16 1.51e-03 0s 8 4.08021810e+01 3.85656754e+01 1.33e-01 1.53e-16 6.25e-04 0s 9 4.04203828e+01 3.94700671e+01 6.00e-02 2.22e-16 2.65e-04 0s 10 4.01310046e+01 3.97693452e+01 1.40e-02 2.22e-16 9.95e-05 0s 11 4.00297642e+01 3.99376528e+01 1.43e-03 2.22e-16 2.51e-05 0s 12 4.00058391e+01 3.99861147e+01 1.91e-04 2.22e-16 5.35e-06 0s 13 4.00004714e+01 3.99990008e+01 6.69e-06 3.04e-16 3.98e-07 0s 14 4.00000005e+01 3.99999996e+01 5.25e-09 3.33e-16 2.28e-10 0s 15 4.00000000e+01 4.00000000e+01 2.91e-13 3.33e-16 2.46e-16 0s Barrier solved model in 15 iterations and 0.02 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 296 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 40.00000 0 27 62.00000 40.00000 35.5% - 0s H 0 0 43.0000000 40.00000 6.98% - 0s H 0 0 42.0000000 40.00000 4.76% - 0s H 0 0 41.0000000 40.00000 2.44% - 0s * 0 0 0 40.0000000 40.00000 0.0% - 0s Cutting planes: Gomory: 1 Clique: 1 Zero half: 8 Explored 0 nodes (952 simplex iterations) in 0.15 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.000000000000e+01, best bound 4.000000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.15 seconds Total run time: 0.19 seconds Objective: 40 Solution: 2 x [1, 2, 86] 1 x [5, 12, 85] 1 x [3, 16, 84] 1 x [5, 17, 83] 1 x [6, 18, 82] 1 x [4, 20, 81] 1 x [8, 19, 80] 1 x [1, 26, 79] 1 x [6, 27, 78] 1 x [13, 25, 77] 1 x [10, 30, 76] 1 x [8, 36, 75] 1 x [19, 25, 74] 1 x [22, 24, 74] 1 x [18, 28, 73] 1 x [15, 31, 72] 1 x [21, 29, 71] 1 x [11, 39, 70] 1 x [5, 45, 69] 1 x [11, 40, 69] 1 x [9, 44, 68] 1 x [3, 47, 67] 1 x [26, 36, 67] 1 x [11, 44, 66] 1 x [14, 42, 65] 1 x [21, 39, 64] 1 x [32, 34, 63] 1 x [20, 41, 62] 1 x [34, 37, 61] 1 x [35, 37, 60] 1 x [9, 48, 59] 1 x [36, 38, 59] 1 x [7, 51, 58] 1 x [6, 52, 57] 1 x [5, 55, 56] 1 x [20, 51, 54] 1 x [23, 51, 53] 1 x [33, 50, 50] 1 x [43, 46, 49]