Build (method = -2) #dp: 59 Step-3' Graph: 17 vertices and 44 arcs (0.00s) Step-4' Graph: 9 vertices and 28 arcs (0.00s) #V4/#V3 = 0.53 #A4/#A3 = 0.64 Ready! (0.00s) Optimize a model with 19 rows, 29 columns and 73 nonzeros Presolve removed 9 rows and 10 columns Presolve time: 0.00s Presolved: 10 rows, 19 columns, 46 nonzeros Variable types: 0 continuous, 19 integer (0 binary) Found heuristic solution: objective 74.0000000 Found heuristic solution: objective 51.0000000 Optimize a model with 10 rows, 19 columns and 46 nonzeros Presolve removed 1 rows and 1 columns Presolved: 9 rows, 18 columns, 45 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.300e+01 Factor NZ : 4.500e+01 Factor Ops : 2.850e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.92885009e+01 -9.61263797e+01 5.15e+01 5.55e-17 1.07e+01 0s 1 5.84159991e+01 1.17672030e+01 2.76e-03 2.78e-16 1.20e+00 0s 2 5.04732810e+01 4.26215006e+01 3.55e-15 1.39e-16 2.01e-01 0s 3 4.65439190e+01 4.62438465e+01 3.55e-15 1.32e-16 7.69e-03 0s 4 4.65003199e+01 4.64996921e+01 1.67e-15 1.11e-16 1.61e-05 0s 5 4.65000000e+01 4.65000000e+01 2.22e-16 1.11e-16 1.64e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 4.65000000e+01 Root relaxation: objective 4.650000e+01, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 46.50000 0 4 51.00000 46.50000 8.82% - 0s H 0 0 47.0000000 46.50000 1.06% - 0s Explored 0 nodes (7 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.700000000000e+01, best bound 4.700000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 47 Solution: 3 x [1] 6 x [2, 10] 8 x [3, 9] 2 x [4, 9] 1 x [5] 1 x [5, 7] 6 x [6, 7, 10] 4 x [6, 8, 10] 16 x [7, 8]