Build (method = -2) #dp: 7799 Step-3' Graph: 127 vertices and 1192 arcs (0.04s) Step-4' Graph: 95 vertices and 1128 arcs (0.04s) #V4/#V3 = 0.75 #A4/#A3 = 0.95 Ready! (0.04s) Optimize a model with 135 rows, 1129 columns and 3205 nonzeros Presolve removed 4 rows and 6 columns Presolve time: 0.01s Presolved: 131 rows, 1123 columns, 3194 nonzeros Variable types: 0 continuous, 1123 integer (0 binary) Found heuristic solution: objective 671.0000000 Found heuristic solution: objective 570.0000000 Optimize a model with 131 rows, 1123 columns and 3194 nonzeros Presolved: 131 rows, 1123 columns, 3194 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.012e+03 Factor NZ : 4.390e+03 Factor Ops : 1.759e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.72841087e+04 -5.74750497e+04 3.82e+04 2.22e-16 2.59e+02 0s 1 4.55018715e+03 -2.12387038e+04 6.19e+03 6.66e-16 4.48e+01 0s 2 1.28048246e+03 -8.50881514e+03 9.34e+02 2.26e-14 8.65e+00 0s 3 6.47855424e+02 -1.73482015e+03 4.59e+01 4.44e-15 1.17e+00 0s 4 3.64025949e+02 -5.91771447e+02 5.43e+00 1.89e-15 4.27e-01 0s 5 2.30591054e+02 -2.80333634e+02 2.72e+00 1.11e-15 2.27e-01 0s 6 1.72874369e+02 -8.77174931e+01 1.50e+00 5.13e-16 1.15e-01 0s 7 1.60603582e+02 4.56965600e+01 8.77e-01 5.45e-16 5.08e-02 0s 8 1.51885660e+02 1.31401872e+02 5.24e-01 7.13e-16 9.07e-03 0s 9 1.43387026e+02 1.39360807e+02 1.37e-01 7.07e-16 1.78e-03 0s 10 1.40405112e+02 1.40371504e+02 1.32e-12 4.30e-16 1.47e-05 0s 11 1.40400005e+02 1.40399972e+02 2.21e-13 6.31e-16 1.47e-08 0s 12 1.40400000e+02 1.40400000e+02 3.65e-12 6.76e-16 1.47e-11 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 1.40400000e+02 Root relaxation: objective 1.404000e+02, 902 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 140.40000 0 29 570.00000 140.40000 75.4% - 0s H 0 0 141.0000000 140.40000 0.43% - 0s Explored 0 nodes (1219 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.410000000000e+02, best bound 1.410000000000e+02, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.07 seconds Total run time: 0.12 seconds Objective: 141 Solution: 4 x [4, 7, 30, 35, 35] 12 x [5, 9, 23, 28, 37] 4 x [14, 15, 17, 21, 31] 1 x [15, 17, 21, 31, 36] 3 x [8, 13, 17, 22, 29] 6 x [11, 11, 17, 18, 25] 1 x [8, 17, 25, 40] 2 x [8, 11, 17, 25, 40] 6 x [8, 13, 16, 36, 39] 6 x [26, 26, 35, 38, 39] 8 x [10, 12, 13, 28, 31] 7 x [13, 15, 28, 31, 37] 3 x [2, 28, 31, 37, 37] 2 x [1, 15, 31, 31, 33] 1 x [15, 31, 31, 33, 37] 16 x [3, 15, 18, 26, 29] 5 x [8, 13, 16, 19, 34] 7 x [11, 11, 16, 32, 34] 18 x [7, 25, 34, 35, 38] 1 x [8, 13, 16, 19, 26] 4 x [1, 3, 6, 19, 26] 1 x [3, 8, 15, 23, 33] 1 x [3, 9, 23, 37] 1 x [4, 7, 9, 12, 37] 6 x [20, 20, 20, 25, 27] 9 x [1, 9, 20, 21, 24] 5 x [1, 1, 2, 20, 37] 1 x [15, 18, 21, 33]