Build (method = -2) #dp: 2476 Step-3' Graph: 282 vertices and 1368 arcs (0.01s) Step-4' Graph: 232 vertices and 1269 arcs (0.01s) #V4/#V3 = 0.82 #A4/#A3 = 0.93 Ready! (0.01s) Optimize a model with 252 rows, 1270 columns and 3359 nonzeros Presolve removed 28 rows and 44 columns Presolve time: 0.02s Presolved: 224 rows, 1226 columns, 3312 nonzeros Variable types: 0 continuous, 1226 integer (77 binary) Found heuristic solution: objective 140.0000000 Optimize a model with 224 rows, 1226 columns and 3312 nonzeros Presolved: 224 rows, 1226 columns, 3312 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.158e+03 Factor NZ : 9.581e+03 Factor Ops : 5.970e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.26730965e+03 -1.58426834e+04 2.43e+04 6.30e-02 8.75e+01 0s 1 4.09567536e+02 -9.89727775e+03 3.30e+03 1.11e-15 1.42e+01 0s 2 2.36556426e+02 -3.36778908e+03 3.74e+02 1.33e-15 2.37e+00 0s 3 2.03210110e+02 -3.19682247e+02 9.86e+00 9.99e-16 2.25e-01 0s 4 1.61665338e+02 -1.05274788e+02 3.27e+00 6.04e-16 1.11e-01 0s 5 1.33545082e+02 -4.92548557e+01 1.92e+00 7.22e-16 7.57e-02 0s 6 1.16233620e+02 -1.66466660e+01 1.01e+00 7.59e-16 5.46e-02 0s 7 1.06093783e+02 1.75752473e+01 6.23e-01 6.54e-16 3.63e-02 0s 8 9.97143430e+01 4.47372710e+01 4.24e-01 7.23e-16 2.25e-02 0s 9 9.08097807e+01 6.55311938e+01 1.89e-01 4.68e-16 1.03e-02 0s 10 8.71706287e+01 7.81684444e+01 9.10e-02 4.64e-16 3.69e-03 0s 11 8.45998115e+01 8.06194579e+01 2.80e-02 4.44e-16 1.63e-03 0s 12 8.38248789e+01 8.20804319e+01 1.00e-02 4.46e-16 7.11e-04 0s 13 8.34383030e+01 8.26112228e+01 2.57e-03 4.88e-16 3.36e-04 0s 14 8.32297250e+01 8.30963841e+01 2.05e-04 4.44e-16 5.42e-05 0s 15 8.32003115e+01 8.31998758e+01 7.35e-07 3.33e-16 1.77e-07 0s 16 8.32000003e+01 8.31999999e+01 1.04e-12 3.54e-16 1.77e-10 0s 17 8.32000000e+01 8.32000000e+01 7.37e-13 3.69e-16 1.77e-13 0s Barrier solved model in 17 iterations and 0.02 seconds Optimal objective 8.32000000e+01 Root relaxation: objective 8.320000e+01, 277 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 83.20000 0 18 140.00000 83.20000 40.6% - 0s H 0 0 84.0000000 83.20000 0.95% - 0s Explored 0 nodes (544 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.400000000000e+01, best bound 8.400000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.08 seconds Total run time: 0.10 seconds Objective: 84 Solution: 4 x [12, 13] 7 x [11, 13] 2 x [5, 13] 1 x [3, 11] 8 x [3, 7, 9, 16] 8 x [5, 14] 3 x [2, 14, 19] 7 x [6, 8] 4 x [8, 12] 1 x [8, 12, 18] 4 x [8, 9, 12] 2 x [5, 8, 10] 1 x [2, 8, 19] 2 x [8, 19, 19] 9 x [15, 17] 8 x [4, 20] 1 x [1] 2 x [1, 15] 5 x [1, 4] 1 x [1, 5, 5] 3 x [5, 15, 15] 1 x [4, 11]