Build (method = -2) #dp: 2816 Step-3' Graph: 108 vertices and 700 arcs (0.01s) Step-4' Graph: 48 vertices and 580 arcs (0.01s) #V4/#V3 = 0.44 #A4/#A3 = 0.83 Ready! (0.01s) Optimize a model with 97 rows, 581 columns and 1651 nonzeros Presolve removed 16 rows and 16 columns Presolve time: 0.01s Presolved: 81 rows, 565 columns, 1581 nonzeros Variable types: 0 continuous, 565 integer (491 binary) Found heuristic solution: objective 24.0000000 Optimize a model with 81 rows, 565 columns and 1581 nonzeros Presolved: 81 rows, 565 columns, 1581 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.800e+02 Factor NZ : 1.749e+03 Factor Ops : 4.999e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.83354955e+02 -2.19950404e+03 3.03e+03 2.53e-01 1.39e+01 0s 1 3.12634431e+02 -6.14803352e+02 7.60e+02 4.44e-16 3.38e+00 0s 2 5.51325731e+01 -1.14204624e+02 6.67e+01 5.00e-16 3.64e-01 0s 3 2.50272454e+01 -4.81198879e+00 3.62e+00 6.66e-16 3.55e-02 0s 4 2.08494228e+01 4.57348532e+00 9.16e-01 4.44e-16 1.60e-02 0s 5 1.88941471e+01 1.33318619e+01 2.91e-01 4.44e-16 5.11e-03 0s 6 1.77809138e+01 1.53776584e+01 1.22e-01 2.22e-16 2.18e-03 0s 7 1.71826140e+01 1.60497832e+01 4.84e-02 2.22e-16 1.02e-03 0s 8 1.67504104e+01 1.63446203e+01 5.27e-03 2.22e-16 3.61e-04 0s 9 1.67022408e+01 1.65298443e+01 2.91e-03 4.44e-16 1.54e-04 0s 10 1.66686031e+01 1.66433337e+01 7.22e-05 2.22e-16 2.24e-05 0s 11 1.66666928e+01 1.66666560e+01 2.72e-13 2.22e-16 3.25e-08 0s 12 1.66666667e+01 1.66666667e+01 9.86e-14 4.44e-16 3.25e-11 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 1.66666667e+01 Root relaxation: objective 1.666667e+01, 303 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 16.66667 0 11 24.00000 16.66667 30.6% - 0s H 0 0 20.0000000 16.66667 16.7% - 0s H 0 0 18.0000000 16.66667 7.41% - 0s H 0 0 17.0000000 16.66667 1.96% - 0s Explored 0 nodes (577 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.700000000000e+01, best bound 1.700000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 17 Solution: 1 x [2, 43, 45] 1 x [46, 49, 49] 1 x [22, 35] 1 x [19, 24, 30] 1 x [15, 23, 47] 1 x [14, 25, 34] 1 x [16, 41, 48] 1 x [10, 27, 32] 1 x [9, 29, 31] 1 x [13, 18, 44] 1 x [12, 28, 37] 1 x [6, 8, 11] 1 x [1, 5, 20] 1 x [4, 39, 42] 1 x [3, 21, 38] 1 x [7, 36, 40] 1 x [17, 26, 33]