Build (method = -2) #dp: 3206 Step-3' Graph: 211 vertices and 1251 arcs (0.01s) Step-4' Graph: 128 vertices and 1085 arcs (0.01s) #V4/#V3 = 0.61 #A4/#A3 = 0.87 Ready! (0.01s) Optimize a model with 178 rows, 1086 columns and 3006 nonzeros Presolve removed 57 rows and 59 columns Presolve time: 0.01s Presolved: 121 rows, 1027 columns, 2941 nonzeros Variable types: 0 continuous, 1027 integer (893 binary) Found heuristic solution: objective 34.0000000 Optimize a model with 121 rows, 1027 columns and 2941 nonzeros Presolved: 121 rows, 1027 columns, 2941 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.425e+03 Factor NZ : 3.527e+03 Factor Ops : 1.319e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.68308649e+02 -1.47624426e+03 4.80e+03 2.88e-01 6.71e+00 0s 1 1.91621892e+02 -5.24955255e+02 8.91e+02 5.55e-16 1.34e+00 0s 2 6.21870344e+01 -1.03677598e+02 1.11e+02 4.44e-16 1.89e-01 0s 3 2.84456388e+01 -3.66556837e+00 7.79e+00 6.66e-16 2.20e-02 0s 4 2.31248736e+01 1.53231686e+01 1.28e-01 4.44e-16 3.85e-03 0s 5 2.16162440e+01 1.82436157e+01 4.92e-02 2.71e-16 1.65e-03 0s 6 2.10413170e+01 1.93800565e+01 2.19e-02 2.52e-16 8.13e-04 0s 7 2.05698225e+01 1.99083109e+01 4.15e-03 4.44e-16 3.23e-04 0s 8 2.03902729e+01 2.01780587e+01 6.42e-04 3.33e-16 1.03e-04 0s 9 2.03304861e+01 2.02386807e+01 1.36e-04 2.22e-16 4.47e-05 0s 10 2.03032768e+01 2.02912738e+01 2.51e-06 2.70e-16 5.85e-06 0s 11 2.03000405e+01 2.02998868e+01 1.02e-08 2.22e-16 7.48e-08 0s 12 2.03000000e+01 2.02999999e+01 8.85e-13 3.33e-16 7.61e-11 0s 13 2.03000000e+01 2.03000000e+01 6.61e-13 2.22e-16 1.20e-16 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 2.03000000e+01 Root relaxation: objective 2.030000e+01, 101 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.30000 0 29 34.00000 20.30000 40.3% - 0s H 0 0 24.0000000 20.30000 15.4% - 0s H 0 0 22.0000000 20.30000 7.73% - 0s H 0 0 21.0000000 20.30000 3.33% - 0s Explored 0 nodes (156 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.100000000000e+01, best bound 2.100000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 21 Solution: 1 x [24, 46] 1 x [25, 44] 1 x [11, 45] 1 x [32, 39] 1 x [19, 49] 1 x [31, 40] 1 x [21, 48] 1 x [29, 37] 1 x [16, 50] 1 x [4, 18, 27] 1 x [34, 35] 1 x [3, 47] 1 x [1, 22, 26] 1 x [5, 17, 23] 1 x [6, 43] 1 x [10, 12, 42] 1 x [28, 41] 1 x [9, 14, 36] 1 x [7, 13, 38] 1 x [2, 20, 30] 1 x [8, 15, 33]