Build (method = -2) #dp: 4759 Step-3' Graph: 132 vertices and 772 arcs (0.02s) Step-4' Graph: 104 vertices and 716 arcs (0.02s) #V4/#V3 = 0.79 #A4/#A3 = 0.93 Ready! (0.02s) Optimize a model with 124 rows, 717 columns and 1952 nonzeros Presolve removed 7 rows and 13 columns Presolve time: 0.01s Presolved: 117 rows, 704 columns, 1928 nonzeros Variable types: 0 continuous, 704 integer (7 binary) Found heuristic solution: objective 339.0000000 Found heuristic solution: objective 284.0000000 Optimize a model with 117 rows, 704 columns and 1928 nonzeros Presolved: 117 rows, 704 columns, 1928 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.192e+03 Factor NZ : 3.260e+03 Factor Ops : 1.051e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.82834926e+03 -2.46725227e+04 2.01e+04 1.56e-01 1.11e+02 0s 1 1.00405884e+03 -9.00797084e+03 2.84e+03 5.55e-16 1.81e+01 0s 2 4.59571081e+02 -3.12888167e+03 4.82e+02 5.55e-16 3.96e+00 0s 3 3.10158657e+02 -5.94277053e+02 1.89e+01 5.55e-16 6.65e-01 0s 4 1.78560248e+02 -2.19272208e+02 6.94e+00 3.33e-16 2.87e-01 0s 5 1.16315865e+02 -8.82647866e+01 3.69e+00 3.05e-16 1.47e-01 0s 6 8.52152017e+01 -3.53673040e+00 1.60e+00 3.33e-16 6.33e-02 0s 7 7.39522683e+01 3.55468106e+01 9.49e-01 3.33e-16 2.75e-02 0s 8 6.92155871e+01 5.81475376e+01 2.78e-01 3.33e-16 7.86e-03 0s 9 6.59232061e+01 6.45403468e+01 4.59e-02 2.14e-16 9.81e-04 0s 10 6.53340946e+01 6.53318326e+01 3.53e-13 2.91e-16 1.59e-06 0s 11 6.53333341e+01 6.53333318e+01 9.97e-14 3.33e-16 1.59e-09 0s 12 6.53333333e+01 6.53333333e+01 1.06e-13 4.44e-16 1.59e-12 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 6.53333333e+01 Root relaxation: objective 6.533333e+01, 470 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 65.33333 0 30 284.00000 65.33333 77.0% - 0s H 0 0 66.0000000 65.33333 1.01% - 0s Explored 0 nodes (875 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.600000000000e+01, best bound 6.600000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.04 seconds Total run time: 0.07 seconds Objective: 66 Solution: 6 x [1, 2, 3, 13, 16, 19] 7 x [1, 2, 3, 11, 13, 19] 9 x [4, 6, 8, 9, 11, 19] 8 x [2, 2, 4, 6, 8, 13] 1 x [4, 5, 9, 9, 15] 9 x [4, 10, 13, 16, 16, 20] 3 x [4, 4, 5, 9, 9, 15] 1 x [6, 7, 9, 11, 12, 17] 13 x [6, 7, 11, 12, 17, 17] 2 x [5, 6, 9, 9, 14, 15] 1 x [6, 7, 9, 11, 14, 17] 4 x [7, 13, 14, 14, 16, 20] 1 x [2, 2, 7, 19] 1 x [2, 13, 16, 18, 19]