Build (method = -2) #dp: 635 Step-3' Graph: 81 vertices and 345 arcs (0.00s) Step-4' Graph: 48 vertices and 279 arcs (0.00s) #V4/#V3 = 0.59 #A4/#A3 = 0.81 Ready! (0.00s) Optimize a model with 73 rows, 280 columns and 748 nonzeros Presolve removed 27 rows and 28 columns Presolve time: 0.00s Presolved: 46 rows, 252 columns, 694 nonzeros Variable types: 0 continuous, 252 integer (209 binary) Found heuristic solution: objective 15.0000000 Found heuristic solution: objective 14.0000000 Found heuristic solution: objective 13.0000000 Optimize a model with 46 rows, 252 columns and 694 nonzeros Presolved: 46 rows, 252 columns, 694 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.500e+02 Factor NZ : 8.790e+02 Factor Ops : 2.030e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.17744343e+02 -3.38087948e+02 6.52e+02 3.09e-01 6.00e+00 0s 1 8.63327391e+01 -1.21365081e+02 1.20e+02 4.44e-16 1.19e+00 0s 2 2.31887848e+01 -2.74763395e+01 1.31e+01 4.44e-16 1.69e-01 0s 3 1.23974429e+01 2.43624192e+00 1.95e-01 4.44e-16 2.04e-02 0s 4 1.05080243e+01 7.51476951e+00 6.34e-05 6.66e-16 5.94e-03 0s 5 1.00104979e+01 8.90585061e+00 1.88e-05 2.22e-16 2.19e-03 0s 6 9.71597158e+00 9.37999874e+00 4.22e-06 2.55e-16 6.67e-04 0s 7 9.62279816e+00 9.54206011e+00 1.31e-06 2.22e-16 1.60e-04 0s 8 9.60073890e+00 9.59933504e+00 1.40e-14 1.11e-16 2.79e-06 0s 9 9.60000003e+00 9.59999992e+00 1.75e-13 2.22e-16 2.14e-10 0s 10 9.60000000e+00 9.60000000e+00 1.42e-13 2.22e-16 2.14e-13 0s Barrier solved model in 10 iterations and 0.00 seconds Optimal objective 9.60000000e+00 Root relaxation: objective 9.600000e+00, 91 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 9.60000 0 21 13.00000 9.60000 26.2% - 0s H 0 0 12.0000000 9.60000 20.0% - 0s H 0 0 11.0000000 9.60000 12.7% - 0s H 0 0 10.0000000 9.60000 4.00% - 0s Explored 0 nodes (138 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.000000000000e+01, best bound 1.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 10 Solution: 1 x [9, 25] 1 x [15, 24] 1 x [3, 6, 23] 1 x [5, 16, 17] 1 x [13, 20] 1 x [2, 11, 22] 1 x [12, 19] 1 x [10, 21] 1 x [1, 8, 14] 1 x [4, 7, 18]