Build (method = -2) #dp: 1024 Step-3' Graph: 55 vertices and 391 arcs (0.00s) Step-4' Graph: 34 vertices and 349 arcs (0.00s) #V4/#V3 = 0.62 #A4/#A3 = 0.89 Ready! (0.00s) Optimize a model with 73 rows, 350 columns and 987 nonzeros Presolve removed 24 rows and 31 columns Presolve time: 0.01s Presolved: 49 rows, 319 columns, 897 nonzeros Variable types: 0 continuous, 319 integer (212 binary) Found heuristic solution: objective 34.0000000 Found heuristic solution: objective 30.0000000 Optimize a model with 49 rows, 319 columns and 897 nonzeros Presolved: 49 rows, 319 columns, 897 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.610e+02 Factor NZ : 9.450e+02 Factor Ops : 2.242e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.31414950e+02 -7.58387679e+02 1.32e+03 2.48e-01 9.55e+00 0s 1 1.50600716e+02 -2.69664831e+02 2.97e+02 5.55e-16 2.22e+00 0s 2 4.56756420e+01 -5.92852584e+01 1.96e+01 3.33e-16 2.46e-01 0s 3 2.95182083e+01 5.55248280e+00 1.98e+00 2.22e-16 4.23e-02 0s 4 2.59041226e+01 1.49755624e+01 3.88e-01 3.33e-16 1.75e-02 0s 5 2.40275804e+01 1.96035065e+01 1.10e-01 2.22e-16 6.94e-03 0s 6 2.31931311e+01 2.14030446e+01 3.35e-02 2.22e-16 2.79e-03 0s 7 2.28756694e+01 2.21898224e+01 1.00e-02 2.22e-16 1.07e-03 0s 8 2.26979942e+01 2.25612898e+01 1.16e-03 2.22e-16 2.12e-04 0s 9 2.26680736e+01 2.26642963e+01 6.74e-05 2.22e-16 5.88e-06 0s 10 2.26666681e+01 2.26666643e+01 8.66e-15 2.22e-16 5.88e-09 0s 11 2.26666667e+01 2.26666667e+01 1.42e-14 2.22e-16 5.89e-15 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 2.26666667e+01 Root relaxation: objective 2.266667e+01, 147 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 22.66667 0 6 30.00000 22.66667 24.4% - 0s H 0 0 25.0000000 22.66667 9.33% - 0s H 0 0 23.0000000 22.66667 1.45% - 0s Explored 0 nodes (228 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.300000000000e+01, best bound 2.300000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.02 seconds Total run time: 0.03 seconds Objective: 23 Solution: 1 x [3, 39] 1 x [4, 38] 1 x [3, 37] 2 x [5, 36] 1 x [7, 35] 1 x [6, 34] 1 x [8, 33] 1 x [15, 32] 1 x [16, 31] 1 x [18, 30] 1 x [17, 29] 2 x [18, 28] 1 x [19, 27] 1 x [10, 27] 1 x [1, 26] 1 x [20, 25] 1 x [21, 24] 1 x [2, 12, 23] 1 x [1, 6, 22] 1 x [8, 11, 16] 1 x [9, 13, 14]