Build (method = -2) #dp: 1911 Step-3' Graph: 73 vertices and 376 arcs (0.01s) Step-4' Graph: 42 vertices and 314 arcs (0.01s) #V4/#V3 = 0.58 #A4/#A3 = 0.84 Ready! (0.01s) Optimize a model with 83 rows, 315 columns and 866 nonzeros Presolve removed 21 rows and 23 columns Presolve time: 0.01s Presolved: 62 rows, 292 columns, 812 nonzeros Variable types: 0 continuous, 292 integer (202 binary) Found heuristic solution: objective 24.0000000 Optimize a model with 62 rows, 292 columns and 812 nonzeros Presolved: 62 rows, 292 columns, 812 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.100e+02 Factor NZ : 1.187e+03 Factor Ops : 2.863e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.57218917e+02 -8.36953198e+02 6.04e+02 2.66e-01 1.10e+01 0s 1 1.16919552e+02 -2.51287883e+02 9.77e+01 5.55e-16 1.93e+00 0s 2 3.95124796e+01 -5.77431160e+01 7.45e+00 4.44e-16 2.46e-01 0s 3 2.53740171e+01 2.34963806e+00 3.99e-01 2.78e-16 4.14e-02 0s 4 2.30710901e+01 1.13298679e+01 1.51e-01 4.44e-16 2.05e-02 0s 5 2.14951002e+01 1.63583003e+01 5.89e-02 4.44e-16 8.85e-03 0s 6 2.01667317e+01 1.85255674e+01 1.67e-02 2.22e-16 2.81e-03 0s 7 1.97594867e+01 1.89787413e+01 5.93e-03 2.70e-16 1.33e-03 0s 8 1.96337815e+01 1.93040167e+01 8.71e-04 2.22e-16 5.61e-04 0s 9 1.95913551e+01 1.93857569e+01 3.67e-04 1.24e-16 3.49e-04 0s 10 1.95727563e+01 1.95621853e+01 5.64e-06 2.22e-16 1.80e-05 0s 11 1.95714299e+01 1.95714193e+01 3.31e-14 4.44e-16 1.80e-08 0s 12 1.95714286e+01 1.95714286e+01 2.42e-14 2.22e-16 1.80e-11 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 1.95714286e+01 Root relaxation: objective 1.957143e+01, 129 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 19.57143 0 17 24.00000 19.57143 18.5% - 0s H 0 0 22.0000000 19.57143 11.0% - 0s H 0 0 20.0000000 19.57143 2.14% - 0s Explored 0 nodes (270 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.02 seconds Total run time: 0.05 seconds Objective: 20 Solution: 1 x [8, 9, 41] 1 x [7, 10, 40] 1 x [1, 39] 1 x [15, 38] 1 x [5, 13, 37] 1 x [6, 12, 36] 1 x [3, 14, 35] 2 x [18, 34] 1 x [20, 33] 1 x [19, 32] 1 x [1, 17, 31] 1 x [24, 30] 1 x [23, 30] 1 x [4, 16, 29] 1 x [2, 22, 28] 1 x [26, 27] 1 x [25, 27] 1 x [4, 21, 27] 1 x [11, 14, 16]