Build (method = -2) #dp: 62 Step-3' Graph: 18 vertices and 47 arcs (0.00s) Step-4' Graph: 11 vertices and 33 arcs (0.00s) #V4/#V3 = 0.61 #A4/#A3 = 0.70 Ready! (0.00s) Optimize a model with 21 rows, 34 columns and 84 nonzeros Presolve removed 9 rows and 10 columns Presolve time: 0.00s Presolved: 12 rows, 24 columns, 57 nonzeros Variable types: 0 continuous, 24 integer (0 binary) Found heuristic solution: objective 59.0000000 Found heuristic solution: objective 58.0000000 Found heuristic solution: objective 57.0000000 Optimize a model with 12 rows, 24 columns and 57 nonzeros Presolved: 12 rows, 24 columns, 57 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.500e+01 Factor NZ : 7.800e+01 Factor Ops : 6.500e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.21549017e+02 -2.18662889e+02 1.02e+02 1.11e-16 1.69e+01 0s 1 6.63871912e+01 -2.89090354e+01 4.70e+00 2.22e-16 2.09e+00 0s 2 5.90870781e+01 1.60868034e+01 3.56e-01 1.39e-16 8.35e-01 0s 3 5.46283033e+01 4.87756454e+01 5.56e-05 2.22e-16 1.13e-01 0s 4 5.20708089e+01 5.18593820e+01 3.94e-07 2.22e-16 4.07e-03 0s 5 5.20000139e+01 5.19999737e+01 3.09e-11 6.38e-17 7.72e-07 0s 6 5.20000000e+01 5.20000000e+01 3.55e-15 2.22e-16 7.92e-13 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 5.20000000e+01 Root relaxation: objective 5.200000e+01, 15 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 52.0000000 52.00000 0.0% - 0s Explored 0 nodes (15 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.200000000000e+01, best bound 5.200000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 52 Solution: 13 x [1, 8] 8 x [2] 3 x [3] 3 x [3, 8, 9] 7 x [3, 9] 8 x [4, 10] 3 x [5, 6] 4 x [5, 6, 10] 3 x [6, 7]