Build (method = -2) #dp: 916 Step-3' Graph: 96 vertices and 426 arcs (0.00s) Step-4' Graph: 63 vertices and 360 arcs (0.00s) #V4/#V3 = 0.66 #A4/#A3 = 0.85 Ready! (0.00s) Optimize a model with 88 rows, 361 columns and 961 nonzeros Presolve removed 31 rows and 31 columns Presolve time: 0.01s Presolved: 57 rows, 330 columns, 928 nonzeros Variable types: 0 continuous, 330 integer (270 binary) Found heuristic solution: objective 12.0000000 Optimize a model with 57 rows, 330 columns and 928 nonzeros Presolved: 57 rows, 330 columns, 928 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.770e+02 Factor NZ : 1.161e+03 Factor Ops : 2.839e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.31363146e+02 -5.06780714e+02 5.90e+02 1.79e-01 5.19e+00 0s 1 9.64007247e+01 -1.67393623e+02 1.20e+02 4.44e-16 1.11e+00 0s 2 2.75027159e+01 -4.08142275e+01 1.47e+01 3.89e-16 1.76e-01 0s 3 1.33581443e+01 -3.52503921e-01 9.97e-01 4.44e-16 2.39e-02 0s 4 1.09237927e+01 7.40297251e+00 2.00e-15 4.44e-16 5.34e-03 0s 5 1.01062838e+01 8.72317405e+00 1.78e-15 2.22e-16 2.10e-03 0s 6 9.77909384e+00 9.13625893e+00 2.66e-15 2.22e-16 9.74e-04 0s 7 9.63901998e+00 9.42163207e+00 8.44e-15 4.44e-16 3.29e-04 0s 8 9.55698968e+00 9.50733112e+00 2.04e-14 2.22e-16 7.53e-05 0s 9 9.53810796e+00 9.53415975e+00 3.76e-14 2.27e-16 5.98e-06 0s 10 9.53571681e+00 9.53571271e+00 2.42e-14 3.33e-16 6.21e-09 0s 11 9.53571429e+00 9.53571428e+00 4.95e-14 4.44e-16 6.21e-12 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 9.53571429e+00 Root relaxation: objective 9.535714e+00, 53 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 9.53571 0 22 12.00000 9.53571 20.5% - 0s H 0 0 10.0000000 9.53571 4.64% - 0s Explored 0 nodes (106 simplex iterations) in 0.02 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.02 seconds Total run time: 0.03 seconds Objective: 10 Solution: 1 x [11, 25] 1 x [13, 24] 1 x [1, 7, 23] 1 x [3, 6, 22] 1 x [9, 21] 1 x [4, 19] 1 x [17, 18] 1 x [16, 20] 1 x [2, 5, 8, 15] 1 x [10, 12, 14]